On the use of spectral libraries to perform sparse unmixing of hyperspectral data

In recent years, the increasing availability of spectral libraries has opened a new path toward solving the hyperspec-tral unmixing problem in a semi-supervised fashion. The spectrally pure constituent materials (called endmembers) can be derived from a (potentially very large) spectral library and used for unmixing purposes. The advantage of this approach is that the results of the unmixing process do not depend on the availability of pure pixels in the original hyperspectral data nor on the ability of an endmember extraction algorithm to identify such endmembers. However, resulting from the fact that spectral libraries are usually very large, this approach generally results in a sparse solution. In this paper, we investigate the sensitivity of sparse unmixing techniques to certain characteristics of real and synthetic spectral libraries, including parameters such as mutual coherence and spectral similarity between the signatures contained in the library. Our main goal is to illustrate, via detailed experimental assessment, the potential of using spectral libraries to solve the spectral unmixing problem.

[1]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[2]  Michael Elad,et al.  On the uniqueness of non-negative sparse & redundant representations , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[4]  S. Foucart,et al.  Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .

[5]  Paul E. Johnson,et al.  Spectral mixture modeling: A new analysis of rock and soil types at the Viking Lander 1 Site , 1986 .

[6]  José M. Bioucas-Dias,et al.  Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing , 2010, 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing.

[7]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[8]  John F. Mustard,et al.  Spectral unmixing , 2002, IEEE Signal Process. Mag..

[9]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[10]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[11]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[12]  Antonio J. Plaza,et al.  A quantitative and comparative analysis of endmember extraction algorithms from hyperspectral data , 2004, IEEE Transactions on Geoscience and Remote Sensing.

[13]  José M. Bioucas-Dias,et al.  Fast Image Recovery Using Variable Splitting and Constrained Optimization , 2009, IEEE Transactions on Image Processing.