A convex analysis-based minimum-volume enclosing simplex algorithm for hyperspectral unmixing

  • Chan T
  • Chi C
  • Huang Y
 et al. 
  • 46


    Mendeley users who have this article in their library.
  • 198


    Citations of this article.


Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspectral scene. Many existing hyperspectral unmixing algorithms were developed under a commonly used assumption that pure pixels exist. However, the pure-pixel assumption may be seriously violated for highly mixed data. Based on intuitive grounds, Craig reported an unmixing criterion without requiring the pure-pixel assumption, which estimates the endmembers by vertices of a minimum-volume simplex enclosing all the observed pixels. In this paper, we incorporate convex analysis and Craig's criterion to develop a minimum-volume enclosing simplex (MVES) formulation for hyperspectral unmixing. A cyclic minimization algorithm for approximating the MVES problem is developed using linear programs (LPs), which can be practically implemented by readily available LP solvers. We also provide a non-heuristic guarantee of our MVES problem formulation, where the existence of pure pixels is proved to be a sufficient condition for MVES to perfectly identify the true endmembers. Some Monte Carlo simulations and real data experiments are presented to demonstrate the efficacy of the proposed MVES algorithm over several existing hyperspectral unmixing methods.

Author-supplied keywords

  • Convex analysis
  • Convex optimization
  • Hyperspectral unmixing
  • Linear programming
  • Minimum-volume enclosing simplex

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Tsung Han Chan

  • Chong Yung Chi

  • Yu Min Huang

  • Wing Kin Ma

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free