Abstract
Linear hyperspectral unmixing (LHU) is a class of important problems in remote sensing. It can be modelled by a linearly constrained convex optimization problem with a coupled objective function. This paper proposes an alternating direction method of multipliers (ADMM) for solving this LHU model. The special structure of the LHU model allows explicit solutions to the subproblems in the ADMM and hence the ADMM is easily implementable. The global convergence of the ADMM is established despite the existence of a coupled term in the objective function. Our numerical experiments with four data sets demonstrated that the proposed ADMM is effective for solving the LHU model.
Similar content being viewed by others
References
Bioucas-Dias JM, Figueiredo MAT (2010) Alternating direction algorithms for constrained sparse regression: application to hyperspectral unmixing. 2nd workshop on hyperspectral image and signal processing: evolution in remote sensing. IEEE, Reykjavik, Iceland, pp 1884–2023
Bioucas-Dias JM (2009) A variable splitting augmented Lagrangian approach to linear spectral unmixing. 2009 first workshop on hyperspectral image and signal processing: evolution in remote sensing. IEEE, Grenoble, France, pp 1–4
Chan TH, Chi CY, Huang YM, Ma WK (2009) A convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing. IEEE Trans Signal Process 57(11):4418–4432
Chen C, He B, Ye Y, Yuan X (2016) The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math Program 155:57–79
Cui Y, Li X, Sun D, Toh KC (2016) On the convergence properties of a majorized alternating direction method of multipliersfor linearly constrained convex optimization problems with coupled objective functions. J Optim Theory Appl 169:1013–1041
Dai YH, Han D, Yuan X, Zhang W (2017) A sequential updating scheme of the lagrange multiplier for separable convex programming. Math Comp 86:315–343
Deng W, Yin W (2016) On the global and linear convergence of the generalized alternating direction method of multipliers. J Sci Comput 66(3):889–916
Li J, Agathos A, Zaharie D et al (2015) Minimum volume simplex analysis: a fastalgorithm for linear hyperspectral unmixing. IEEE Trans Geosci Remote Sens 53:5067–5082
Li J, Li X, Zhao L (2017) Hyperspectral Unmixing Via Projected Mini-batch Gradient Descent. International geoscience and remote sensing symposium (IGARSS’2017). IEEE, Fort Worth, Texas, pp 1133–1136
Nascimento JMP, Bioucasdias JM (2007) Hyperspectral unmixing algorithm via dependent component analysis. IEEE international symposium on geoscience and remote sensing IGARSS. IEEE, Barcelona, Spain, pp 4033–4036
Nascimento JMP, Bioucasdias JM (2012) Hyperspectral unmixing based on mixtures of Dirichlet components. IEEE Trans Geosci Remote Sens 50(3):863–878
Plaza A, Martinez P, Perez R, Plaza J (2002) Spatial/spectral endmember extraction by multidimensional morphological operations. IEEE Trans Geosci Remote Sens 40(9):2025–2041
Plaza A, Martinez P, Perez R, Plaza J (2004) A quantitative and comparative analysis of endmember extraction algorithms from hyperspectral data. IEEE Trans Geosci Remote Sens 42(3):650–663
Qian Y, Jia S, Zhou J, Robles-Kelly A (2011) Hyperspectral unmixing via \( l_ {1/2}\) sparsity-constrained nonnegative matrix factorization. IEEE Trans Geosci Remote Sens 49(11):4282–4297
Wang W, Carreira-Perpinán MÁ (2013) Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application. arXiv:1309.1541
Xu F, Wang Y, Li Y, Liu L, Tian T (2022) Gradient type methods for linear hyperspectral unmixing. CSIAM Trans Appl Math 3(1):109–132
Zhu F, Wang Y, Fan B, Meng G, Xiang S, Pan C (2014) Spectral unmixing via data-guided sparsity. IEEE Trans Image Process 23(12):5412–5427
Zhu F, Wang Y, Xiang S, Fan B, Pan C (2014) Structured sparse method for hyperspectral unmixing. ISPRS J Photogramm Remote Sens 88:101–118
Zhu F, Honeine P (2015) Online Nonnegative Matrix Factorization Based on Kernel Machines. 23rd European conference on signal processing (EUSIPCO’2015). IEEE, Nice, France, pp 2381–2385
Zhu F, Wang Y, Fan B, Meng G, Pan C (2014c) Effective spectral unmixing via robust representation and learning-based sparsity. arXiv:1409.0685v3
Acknowledgements
Y. H. Dai was supported by the Natural Science Foundation of China (Nos. 11991020, 11631013, 11971372 and 11991021) and the Strategic Priority Research Program of Chinese Academy of Sciences (No. XDA27000000). F. Xu was supported in part by the Tian Yuan Mathematical Foundation (Nos. 12126348 and 12126370) and the National Natural Science Foundation of China No. 11901359. L. Zhang was supported by the Natural Science Foundation of China (Nos. 11971089 and 11731013) and partially supported by Dalian High-level Talent Innovation Project No. 2020RD09.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no potential conflicts of interest or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Dai, YH., Xu, F. & Zhang, L. Alternating direction method of multipliers for linear hyperspectral unmixing. Math Meth Oper Res 97, 289–310 (2023). https://doi.org/10.1007/s00186-023-00815-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-023-00815-2
Keywords
- Linear hyperspectral unmixing
- Endmembers
- Alternating direction method of multipliers
- Globally convergence
- Coupled objective function