Bilateral Joint-Sparse Regression for Hyperspectral Unmixing
Open Access
- 24 September 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 14 (19391404) , 10147-10161
Abstract
Sparse hyperspectral unmixing has been a hot topic in recent years. Joint sparsity assumes that each pixel in a small neighborhood of hyperspectral images (HSIs) is composed of the same endmembers, which results in a few nonzero rows in the abundance matrix. Recall that a plethora of unmixing algorithms transform a 3-D HSI into a 2-D matrix with vertical priority. The transformation makes matrix computation easier. It is, however, hard to maintain the horizontal spatial information in HSIs in many cases. To make further use of the spatial information of HSIs, in this article, we propose a bilateral joint-sparse structure for hyperspectral unmixing in an attempt to exploit the local joint sparsity of the abundance matrix in both the vertical and horizontal directions. In particular, we introduce a permutation matrix to realize the bilateral joint-sparse representation and there is no need to construct the matrix explicitly. Moreover, we propose to simultaneously impose the bilateral joint-sparse structure and low rankness on the abundance and develop a new algorithm named bilateral joint-sparse and low-rank unmixing . The proposed algorithm is based on the alternating direction method of multipliers framework and employs a reweighting strategy. The convergence analysis of the proposed algorithm is investigated. Simulated and real-data experiments show the effectiveness of the proposed algorithm.Keywords
Funding Information
- National Natural Science Foundation of China (12171072, 61772003)
- Key Projects of Applied Basic Research in Sichuan Province (2020YJ0216)
- National Key R&D Program of China (2020YFA0714001)
- Fundamental Research Funds for the Central Universities (ZYGX2019J093)
This publication has 54 references indexed in Scilit:
- Total Variation Structured Total Least Squares Method for Image RestorationSIAM Journal on Scientific Computing, 2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Hyperspectral Unmixing via $L_{1/2}$ Sparsity-Constrained Nonnegative Matrix FactorizationIEEE Transactions on Geoscience and Remote Sensing, 2011
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- Imaging spectroscopy: Earth and planetary remote sensing with the USGS Tetracorder and expert systemsJournal of Geophysical Research, 2003
- Spectral unmixingIEEE Signal Processing Magazine, 2002
- Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imageryIEEE Transactions on Geoscience and Remote Sensing, 2001
- Application of the alternating direction method of multipliers to separable convex programming problemsComputational Optimization and Applications, 1992
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational InequalitiesSIAM Journal on Control and Optimization, 1991