Abstract:

An extension of the Iterated Constrained Endmembers (ICE) algorithm that incorporates sparsity promoting priors to find the correct number of endmembers is presented. In addition to solving for endmembers and endmember fractional maps, this algorithm attempts to autonomously determine the number of endmembers required for a particular scene. The number of endmembers is found by adding a sparsity-promoting term to ICE’s objective function. This method is applied to long wave infrared, LWIR, hyperspectral data to seek out vegetation endmembers and define a vegetation mask for the reduction of false alarms in landmine data.

Links:

Citation:

A. Zare and P. Gader, “SPICE: a sparsity promoting iterated constrained endmember extraction algorithm with applications to landmine detection from hyperspectral imagery,” in Proc. SPIE 6553, Detection and Remediation Technologies for Mines and Minelike Targets XII, 2007. 

@InProceedings{zare2007spice,
Title = {SPICE: a sparsity promoting iterated constrained endmember extraction algorithm with applications to landmine detection from hyperspectral imagery},
Author = {Zare, Alina and Gader, Paul},
Booktitle = {Proc. SPIE 6553, Detection and Remediation Technologies for Mines and Minelike Targets XII},
Year = {2007},
Month = {Apr.},
Number = {655319},
Volume = {6553},
Doi = {10.1117/12.722595},
}