Robust endmember detection using L1 norm factorization


The results from L1-Endmembers display the algorithm’s stability and accuracy with increasing levels of noise. The algorithm was extremely stable in the number of endmembers when compared to the SPICE algorithm and the Virtual Dimensionality methods for estimating the number of endmembers. Furthermore, the results shown for this algorithm were generated with the same parameter set for all of the data sets, from two-dimensional data to 51-dimensional real hyperspectral data. This indicates L1-Endmembers may lack of sensitivity to parameter value settings. The L1-Endmembers algorithm requires several quadratic programming steps per iteration. These can be completed directly in quadratic programming software packages such as CPLEX and take advantage of any running time reductions the software packages provide. Investigations will be conducted into whether the specific form of this algorithm, particularly with respect to the constraints on the abundance values, can be used to reduce the running time.




 A. Zare and P. Gader, “Robust endmember detection using L1 norm factorization,” in IEEE Int. Geoscience and Remote Sens. Symp. (IGARSS), 2010, pp. 971-974. 
Title = {Robust endmember detection using L1 norm factorization},
Author = {Alina Zare and Paul Gader},
Booktitle = {IEEE Int. Geoscience and Remote Sens. Symp. (IGARSS)},
Year = {2010},
Month = {July},
Pages = {971 -974},
Doi = {10.1109/IGARSS.2010.5653679},