IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing· 2012Q1· Review
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches
- 2,755citations
- Q1SCImago
- 2012year
Short summary
This paper provides a comprehensive overview of hyperspectral unmixing techniques, categorizing them into geometrical, statistical, sparsity-based, and spatial-contextual approaches.
AI-generated from the title and abstract; the full text is not read.
Key points
- Hyperspectral cameras offer high spectral resolution for material identification.
- Unmixing algorithms estimate endmember spectra and abundances within mixed pixels.
- Key approaches include geometrical, statistical, sparsity-based, and spatial-contextual methods.
- Challenges include model inaccuracies, noise, and data set size.
AI-generated from the title and abstract; the full text is not read.
Abstract
Imaging spectrometers measure electromagnetic energy scattered in their instantaneous field view in hundreds or thousands of spectral channels with higher spectral resolution than multispectral cameras. Imaging spectrometers are therefore often referred to as hyperspectral cameras (HSCs). Higher spectral resolution enables material identification via spectroscopic analysis, which facilitates countless applications that require identifying materials in scenarios unsuitable for classical spectroscopic analysis. Due to low spatial resolution of HSCs, microscopic material mixing, and multiple scattering, spectra measured by HSCs are mixtures of spectra of materials in a scene. Thus, accurate estimation requires unmixing. Pixels are assumed to be mixtures of a few materials, called endmembers. Unmixing involves estimating all or some of: the number of endmembers, their spectral signatures, and their abundances at each pixel. Unmixing is a challenging, ill-posed inverse problem because of model inaccuracies, observation noise, environmental conditions, endmember variability, and data set size. Researchers have devised and investigated many models searching for robust, stable, tractable, and accurate unmixing algorithms. This paper presents an overview of unmixing methods from the time of Keshava and Mustard's unmixing tutorial to the present. Mixing models are first discussed. Signal-subspace, geometrical, statistical, sparsity-based, and spatial-contextual unmixing algorithms are described. Mathematical problems and potential solutions are described. Algorithm characteristics are illustrated experimentally.
The authors' abstract, as published at the source. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Media Technology
Media TechnologyEngineering