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

@article{Ambikapathi2011ChanceConstrainedRM,
  title={Chance-Constrained Robust Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing},
  author={Arul-Murugan Ambikapathi and Tsung-Han Chan and Wing-Kin Ma and Chong-Yung Chi},
  journal={IEEE Transactions on Geoscience and Remote Sensing},
  year={2011},
  volume={49},
  pages={4194-4209}
}
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… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS
41 Citations
51 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

62 Citations

051015'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 51 references

Convex Optimization

  • S. Boyd, L. Vandenberghe
  • Cambridge, U.K.: Cambridge Univ. Press
  • 2004
Highly Influential
4 Excerpts

Spectral unmixing,

  • N. Keshava, J. Mustard
  • IEEE Signal Process. Mag.,
  • 2002
Highly Influential
10 Excerpts

CVX: Matlab Software for disciplined convex programming, Oct

  • M. Grant, S. Boyd
  • 2010
Highly Influential
4 Excerpts

and A

  • T.-H. Chan, C.-Y. Chi, W.-K. Ma
  • Ambikapathi, “Hyperspectral unmixing from a…
  • 2009
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…