Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing

Convex optimization problems are common in hyperspectral unmixing. Examples are the constrained least squares (CLS) problem used to compute the fractional abundances in a linear mixture of known spectra, the constrained basis pursuit (CBP) to find sparse (i.e., with a small number of terms) linear mixtures of spectra, selected from large libraries, and the constrained basis pursuit denoising (CBPDN), which is a generalization of BP to admit modeling errors. In this paper, we introduce two new algorithms to efficiently solve these optimization problems, based on the alternating direction method of multipliers, a method from the augmented Lagrangian family. The algorithms are termed SUnSAL (sparse unmixing by variable splitting and augmented Lagrangian) and C-SUnSAL (constrained SUnSAL). C-SUnSAL solves the CBP and CBPDN problems, while SUnSAL solves CLS as well as a more general version thereof, called constrained sparse regression (CSR). C-SUnSAL and SUnSAL are shown to outperform off-the-shelf methods in terms of speed and accuracy.

[1]  R. Glowinski,et al.  Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires , 1975 .

[2]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[3]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

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

[5]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[6]  John P. Kerekes,et al.  Algorithm taxonomy for hyperspectral unmixing , 2000, SPIE Defense + Commercial Sensing.

[7]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[8]  Antonio J. Plaza,et al.  Spatial/spectral endmember extraction by multidimensional morphological operations , 2002, IEEE Trans. Geosci. Remote. Sens..

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

[10]  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.

[11]  José M. Bioucas-Dias,et al.  Does independent component analysis play a role in unmixing hyperspectral data? , 2005, IEEE Trans. Geosci. Remote. Sens..

[12]  Chein-I Chang,et al.  A New Growing Method for Simplex-Based Endmember Extraction Algorithm , 2006, IEEE Transactions on Geoscience and Remote Sensing.

[13]  Hairong Qi,et al.  Endmember Extraction From Highly Mixed Data Using Minimum Volume Constrained Nonnegative Matrix Factorization , 2007, IEEE Transactions on Geoscience and Remote Sensing.

[14]  A. Bruckstein,et al.  A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique , 2007 .

[15]  José M. Bioucas-Dias,et al.  Dependent Component Analysis: A Hyperspectral Unmixing Algorithm , 2007, IbPRIA.

[16]  Jon Atli Benediktsson,et al.  On the decomposition of Mars hyperspectral data by ICA and Bayesian positive source separation , 2008, Neurocomputing.

[17]  Michael Elad,et al.  On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations , 2008, IEEE Transactions on Information Theory.

[18]  A. Bruckstein,et al.  Sparse non-negative solution of a linear system of equations is unique , 2008, 2008 3rd International Symposium on Communications, Control and Signal Processing.

[19]  Chein-I Chang,et al.  Semi-Supervised Linear Spectral Unmixing Using a Hierarchical Bayesian Model for Hyperspectral Imagery , 2008, IEEE Transactions on Signal Processing.

[20]  Paul D. Gader,et al.  Hyperspectral Band Selection and Endmember Detection Using Sparsity Promoting Priors , 2008, IEEE Geoscience and Remote Sensing Letters.

[21]  José M. Bioucas-Dias,et al.  A variable splitting augmented Lagrangian approach to linear spectral unmixing , 2009, 2009 First Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing.

[22]  Stanley Osher,et al.  A split Bregman method for non-negative sparsity penalized least squares with applications to hyperspectral demixing , 2010, 2010 IEEE International Conference on Image Processing.

[23]  Mário A. T. Figueiredo,et al.  Near-infrared hyperspectral unmixing based on a minimum volume criterion for fast and accurate chemometric characterization of counterfeit tablets. , 2010, Analytical chemistry.

[24]  Ernie Esser,et al.  Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman , 2009 .

[25]  Antonio J. Plaza,et al.  On the use of spectral libraries to perform sparse unmixing of hyperspectral data , 2010, 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing.

[26]  W. Marsden I and J , 2012 .

[27]  Antonio J. Plaza,et al.  Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches , 2012, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.