A Gaussian mixture model representation of endmember variability in hyperspectral unmixing
Not on the map. Why?
Abstract (arXiv)
Hyperspectral unmixing while considering endmember variability is usually performed by the normal compositional model (NCM), where the endmembers for each pixel are assumed to be sampled from unimodal Gaussian distributions. However, in real applications, the distribution of a material is often not Gaussian. In this paper, we use Gaussian mixture models (GMM) to represent the endmember variability. We show, given the GMM starting premise, that the distribution of the mixed pixel (under the linear mixing model) is also a GMM (and this is shown from two perspectives). The first perspective originates from the random variable transformation and gives a conditional density function of the pixels given the abundances and GMM parameters. With proper smoothness and sparsity prior constraints on the abundances, the conditional density function leads to a standard maximum a posteriori (MAP) problem which can be solved using generalized expectation maximization. The second perspective originates from marginalizing over the endmembers in the GMM, which provides us with a foundation to solve for the endmembers at each pixel. Hence, our model can not only estimate the abundances and distribution parameters, but also the distinct endmember set for each pixel. We tested the proposed GMM on several synthetic and real datasets, and showed its potential by comparing it to current popular methods.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 2; 2026: 2.
7 papers.
- 2023Dynamical Hyperspectral Unmixing with Variational Recurrent Neural Networkscited by 8
- 2023Learning Interpretable Deep Disentangled Neural Networks for Hyperspectral Unmixingcited by 2
- 2024Hyperspectral Unmixing Under Endmember Variability: A Variational Inference Frameworkcited by 0
- 2025A General Framework for Group Sparsity in Hyperspectral Unmixing Using Endmember Bundlescited by 0
- 2025SMILE: A Super-resolution Guided Multi-task Learning Method for Hyperspectral Unmixingcited by 0
- 2026Hyperspectral Unmixing Hierarchiescited by 0
- 2026Robust blind unmixing: A geometric approach to overcoming basis variationcited by 0
- 2026Robust blind unmixing: A geometric approach to overcoming basis variation2 Oct 2026
- 2026Hyperspectral Unmixing Hierarchies18 Apr 2026
- 2025SMILE: A Super-resolution Guided Multi-task Learning Method for Hyperspectral Unmixing14 Sep 2025
- 2025A General Framework for Group Sparsity in Hyperspectral Unmixing Using Endmember Bundles20 May 2025
- 2024Hyperspectral Unmixing Under Endmember Variability: A Variational Inference Framework20 Jul 2024
- 2023Learning Interpretable Deep Disentangled Neural Networks for Hyperspectral Unmixing3 Oct 2023
- 2023Dynamical Hyperspectral Unmixing with Variational Recurrent Neural Networks19 Mar 2023