Chance-Constrained Robust Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

• Published in: IEEE transactions on geoscience and remote sensing Vol. 49; no. 11; pp. 4194 - 4209
• Main Authors: Ambikapathi, A., Chan, T., Wing-Kin Ma, Chong-Yung Chi
• Format: Journal Article
• Language: English
• Published: IEEE 01.11.2011
• Subjects: Abundance map; Algorithm design and analysis; chance-constrained optimization; convex analysis; endmember signature; Gaussian noise; Hyperspectral imaging; hyperspectral imaging (HI); hyperspectral unmixing (HU); Noise measurement; sequential quadratic programming (SQP)
• ISSN: 0196-2892; 1558-0644
• DOI: 10.1109/TGRS.2011.2151197

Effective unmixing of hyperspectral data cube under a noisy scenario has been a challenging research problem in remote sensing arena. A branch of existing hyperspectral unmixing algorithms is based on Craig's criterion, which states that the vertices of the minimum-volume simplex enclosing the hyperspectral data should yield high fidelity estimates of the endmember signatures associated with the data cloud. Recently, we have developed a minimum-volume enclosing simplex (MVES) algorithm based on Craig's criterion and validated that the MVES algorithm is very useful to unmix highly mixed hyperspectral data. However, the presence of noise in the observations expands the actual data cloud, and as a consequence, the endmember estimates obtained by applying Craig-criterion-based algorithms to the noisy data may no longer be in close proximity to the true endmember signatures. In this paper, we propose a robust MVES (RMVES) algorithm that accounts for the noise effects in the observations by employing chance constraints. These chance constraints in turn control the volume of the resulting simplex. Under the Gaussian noise assumption, the chance-constrained MVES problem can be formulated into a deterministic nonlinear program. The problem can then be conveniently handled by alternating optimization, in which each subproblem involved is handled by using sequential quadratic programming solvers. The proposed RMVES is compared with several existing benchmark algorithms, including its predecessor, the MVES algorithm. Monte Carlo simulations and real hyperspectral data experiments are presented to demonstrate the efficacy of the proposed RMVES algorithm.