35
Views
0
CrossRef citations to date
0
Altmetric
Research article

Robust hyperspectral unmixing using weighted group sparsity and minimum volume regularization

, ORCID Icon &
Pages 4576-4607 | Received 25 Feb 2024, Accepted 14 May 2024, Published online: 02 Jul 2024
 

ABSTRACT

Hyperspectral unmixing (HU) has been a vital technique in hyperspectral image processing. Over the past years, many algorithms have been developed based on the nonnegative matrix factorization (NMF) framework. However, the conventional methods based on the NMF need prior information of the number of endmembers, which is usually estimated by a separate procedure. Therefore, the precision of estimating the number of endmembers will impact the subsequent unmixing effect. Thus, collaborating between the two processes is desired to avoid the propagation of errors. This paper proposes a new NMF-based method, which can estimate the number of endmembers and extract the endmembers and the abundance maps. Firstly, we introduce the weighted group sparsity regularization to adaptively eliminate the abundances corresponding to the redundant endmembers, while the abundances of the true endmembers are preserved. Then the number of endmembers can be determined by the reconstruction error function and the l2-norm of the abundance vectors. Secondly, since the simplex determined by the endmembers has the minimum volume among all simplexes that circumscribe the data points, we impose the total variational regularization to force the endmembers to be close to each other to minimize the simplex volume. And because the total variational regularization avoids the use of noisy pixels, it can decrease the influence of noise and improve the robustness of the solution. For the proposed model, we design an effective algorithm to solve it. Also, the experimental results based on the synthetic data and real data demonstrate that the proposed method can identify the endmembers number well and achieve robust unmixing results.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Notes

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 689.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.