Fast Hyperspectral Unmixing via Reweighted Sparse Regression
Open Access
- 1 September 2019
- journal article
- research article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (9) , 1819-1832
Abstract
The sparse unmixing of hyperspectral data has attracted much attention in recent years because it does not need to estimate the number of endmembers nor consider the lack of pure pixels in a given hyperspectral scene. However, the high mutual coherence of spectral libraries strongly affects the practicality of sparse unmixing. The collaborative sparse unmixing via variable splitting and augmented Lagrangian (CLSUnSAL) algorithm is a classic sparse unmixing algorithm that performs better than other sparse unmixing methods. In this paper, we propose a CLSUnSAL-based hyperspectral unmixing method based on dictionary pruning and reweighted sparse regression. First, the algorithm identifies a subset of the original library elements using a dictionary pruning strategy. Second, we present a weighted sparse regression algorithm based on CLSUnSAL to further enhance the sparsity of endmember spectra in a given library. Third, we apply the weighted sparse regression algorithm on the pruned spectral library. The effectiveness of the proposed algorithm is demonstrated on both simulated and real hyperspectral datasets. For simulated data cubes (DC1, DC2 and DC3), the number of the pruned spectral library elements is reduced by at least 94% and the runtime of the proposed algorithm is less than 10% of that of CLSUnSAL. For simulated DC4 and DC5, the runtime of the proposed algorithm is less than 15% of that of CLSUnSAL. For the real hyperspectral datasets, the pruned spectral library successfully reduces the original dictionary size by 76% and the runtime of the proposed algorithm is 11.21% of that of CLSUnSAL. These experimental results show that our proposed algorithm not only substantially improves the accuracy of unmixing solutions but is also much faster than some other state-of-the-art sparse unmixing algorithms.Keywords
This publication has 40 references indexed in Scilit:
- Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search Are RelatedIEEE Journal of Selected Topics in Signal Processing, 2015
- Sparse Unmixing of Hyperspectral Data Using Spectral A Priori InformationIEEE Transactions on Geoscience and Remote Sensing, 2014
- Hyperspectral Image Denoising via Sparse Representation and Low-Rank ConstraintIEEE Transactions on Geoscience and Remote Sensing, 2014
- A Signal Processing Perspective on Hyperspectral Unmixing: Insights from Remote SensingIEEE Signal Processing Magazine, 2013
- MUSIC-CSR: Hyperspectral Unmixing via Multiple Signal Classification and Collaborative Sparse RegressionIEEE Transactions on Geoscience and Remote Sensing, 2013
- Collinearity and orthogonality of endmembers in linear spectral unmixingInternational Journal of Applied Earth Observation and Geoinformation, 2012
- Hyperspectral Unmixing via $L_{1/2}$ Sparsity-Constrained Nonnegative Matrix FactorizationIEEE Transactions on Geoscience and Remote Sensing, 2011
- Coupled segmentation and denoising/deblurring models for hyperspectral material identificationNumerical Linear Algebra with Applications, 2010
- Nonlinear Hyperspectral Mixture Analysis for tree cover estimates in orchardsRemote Sensing of Environment, 2009
- Hyperspectral subpixel target detection using the linear mixing modelIEEE Transactions on Geoscience and Remote Sensing, 2001