Hyperspectral Image Data Reduction for Endmember Extraction
Not on the map. Why?
Abstract (arXiv)
Endmember extraction from hyperspectral images aims to identify the spectral signatures of materials present in a scene. Recent studies have shown that self-dictionary methods can achieve high extraction accuracy; however, their high computational cost limits their applicability to large-scale hyperspectral images. Although several approaches have been proposed to mitigate this issue, it remains a major challenge. Motivated by this situation, this paper pursues a data reduction approach. Assuming that a hyperspectral image follows the linear mixing model with the pure-pixel assumption, we develop a data reduction technique to remove pixels corresponding to mixtures of multiple endmember signatures. We analyze the theoretical properties of this reduction step and show that it preserves pixels that lie close to the endmembers. Building on this result, we propose a data-reduced self-dictionary method that integrates the data reduction with a self-dictionary method based on a linear programming formulation. Numerical experiments demonstrate that the proposed method can substantially reduce the computational time of the original self-dictionary method without sacrificing endmember extraction accuracy.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 39 references that are in the map. First posted on arXiv 11 Dec 2025.
Builds on
16 of 39 references.
References · 16
- 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
- 2017Hyperspectral Unmixing: Ground Truth Labeling, Datasets, Benchmark Performances and Surveycited by 33
- 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
- 2013Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separationcited by 18
- 2019Blind Audio Source Separation with Minimum-Volume Beta-Divergence NMFcited by 16
- 2013Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorizationcited by 13
- 2013Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimizationcited by 12
- 2016A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionarycited by 8
- 2013Ellipsoidal Rounding for Nonnegative Matrix Factorization Under Noisy Separabilitycited by 7
- 2021Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank-Wolfe Approachcited by 6
- 2021Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separabilitycited by 3
- 2015Robustness Analysis of Preconditioned Successive Projection Algorithm for General Form of Separable NMF Problemcited by 2
4 more
Built on by
Not cited yet.