Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Remote Sensing›Hyperspectral Unmixing
Machine learningRemote sensing

Hyperspectral Unmixing

Spectral Unmixing of Hyperspectral Imagery · Also known as: Spectral Mixture Analysis, Linear Spectral Unmixing, Blind Source Separation (Hyperspectral), Hiperspektral Ayrıştırma

Hyperspectral unmixing is a signal processing technique that decomposes each pixel of a hyperspectral image into a collection of pure material spectra (endmembers) and their corresponding fractional abundances. Because sensor resolution often causes multiple land-cover types to co-occupy a single pixel, unmixing recovers sub-pixel compositional information that conventional classification cannot. Keshava and Mustard (2002) provided the foundational signal-processing framework that unified prior geological and remote-sensing work under a rigorous linear mixture model.

ScholarGate
  1. Machine learning
  2. v1
  3. 1 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Hyperspectral Unmixing
Non-negative Matrix Fact…Pixel-Based Classificati…

When to use it

Use hyperspectral unmixing when sensors capture scenes at a spatial resolution coarser than the scale of heterogeneity among materials of interest, such as minerals, vegetation types, or urban surfaces. The linear mixture model is appropriate when light interacts with materials in a single-bounce fashion (intimate mixtures require nonlinear extensions). Alternatives include pixel-based hard classifiers when spatial resolution is sufficient, or nonlinear unmixing methods when multiple-scattering dominates. The method requires that the number of endmembers be specified or estimated, and that at least quasi-pure pixel spectra exist in the scene.

Strengths & limitations

Strengths
  • Recovers sub-pixel material proportions that hard classifiers cannot provide.
  • Interpretable outputs: endmember spectra are physically meaningful and matchable against spectral libraries.
  • Scales efficiently to large image cubes after initial dimensionality reduction.
  • Provides a rigorous probabilistic interpretation when formulated under a Bayesian or constrained least-squares framework.
Limitations
  • The linear mixture model fails in scenes with intimate mixing or significant multiple scattering.
  • Performance degrades when no pure pixels exist for every endmember in the scene.
  • The number of endmembers p must be set a priori or estimated, introducing sensitivity to misspecification.
  • Spectral variability of endmembers across the scene (due to illumination, viewing angle, or phenology) violates the fixed-endmember assumption and inflates abundance errors.

Frequently asked

What is the difference between hard classification and spectral unmixing?

Hard classification assigns each pixel to exactly one class, assuming the pixel is spectrally pure. Spectral unmixing instead estimates a continuous mixture of materials within each pixel, yielding fractional abundance maps. Unmixing is appropriate when sensor pixels are larger than the spatial scale of the materials, whereas hard classification suffices when pixels are predominantly pure.

Is the linear mixture model always valid?

No. The linear model assumes single-bounce light interaction between the sensor and surface materials—a reasonable approximation for most flat, heterogeneous canopy or mineral surfaces. When photons scatter among multiple materials before reaching the sensor (intimate or intra-pixel mixing, dense vegetation), nonlinear mixture models such as bilinear or radiative-transfer-based approaches are more appropriate.

How do I determine the number of endmembers?

Common strategies include the Virtual Dimensionality (VD) estimator based on Neyman-Pearson detection theory, information-theoretic criteria such as minimum description length, and scree-plot inspection of PCA eigenvalues. Analysts should also consult prior knowledge of the study scene, as statistical estimators can be sensitive to noise level and scene complexity.

Sources

  1. Keshava, N., & Mustard, J. F. (2002). Spectral unmixing. IEEE Signal Processing Magazine, 19(1), 44–57. DOI: 10.1109/79.974727 ↗

How to cite this page

ScholarGate. (2026, June 2). Spectral Unmixing of Hyperspectral Imagery. ScholarGate. https://scholargate.app/en/remote-sensing/hyperspectral-unmixing

Related methods

Non-negative Matrix FactorizationPixel-Based Classification

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Non-negative Matrix FactorizationMachine learning↔ compare
  • Pixel-Based ClassificationRemote Sensing↔ compare
Compare side by side →

Similar methods

Pixel-Based ClassificationRemote Sensing ClassificationObject-Based Image AnalysisDeep Remote SensingGlobal Remote Sensing ClassificationNon-negative Matrix FactorizationChange DetectionMixture Modeling

Related reference concepts

Cluster AnalysisK-Means ClusteringPartial Least Squares RegressionAstronomical Image ProcessingModel-Based ClusteringColor Science and Appearance

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Hyperspectral Unmixing (Spectral Unmixing of Hyperspectral Imagery). Retrieved 2026-07-20 from https://scholargate.app/en/remote-sensing/hyperspectral-unmixing · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Nirmal Keshava & John Mustard
Year
2002
Type
Sub-pixel spectral decomposition algorithm
Subfamily
Remote sensing
Input
Hyperspectral image cube (pixels × bands)
Output
Endmember spectra + fractional abundance maps
Related methods
Non-negative Matrix FactorizationPixel-Based Classification
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account