A two-step iterative algorithm for sparse hyperspectral unmixing via total variation

Sparse hyperspectral unmixing is a hot topic in the field of remote sensing. Its goal is to find an optimal spectral subset, from a large spectral library, to properly model the mixed pixels in hyperspectral images. Sparse unmixing via variable splitting augmented Lagrangian and total variation (SUn...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 401; p. 126059
Main Authors Wang, Jin-Ju, Huang, Ting-Zhu, Huang, Jie, Deng, Liang-Jian
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.07.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Sparse hyperspectral unmixing is a hot topic in the field of remote sensing. Its goal is to find an optimal spectral subset, from a large spectral library, to properly model the mixed pixels in hyperspectral images. Sparse unmixing via variable splitting augmented Lagrangian and total variation (SUnSAL-TV) incorporates a TV regularizer into sparse unmixing, achieving a promising unmixing performance. Note that, SUnSAL-TV is solved by the framework of the alternating direction method of multipliers (ADMM). In this paper, we first propose a weighted collaborative sparse unmixing via TV model, named as WCSU-TV, for hyperspectral unmixing. Then a two-step iterative strategy, based on ADMM, is designed to solve the proposed model. Its key idea is to compute the current solution by a linear combination of the results of two previous iterates, instead of only using current solution in classic ADMM. Experiments on simulated and real hyperspectral data illustrate the effectiveness of the proposed approach.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2021.126059