Several of the more important endmember-finding algorithms for hyperspectral data are discussed and some of their shortcomings highlighted. A new algorithm - iterated constrained endmembers (ICE) - which attempts to address these shortcomings is introduced. An example of its use is given. There is also a discussion of the advantages and disadvantages of normalizing spectra before the application of ICE or other endmember-finding algorithms.
|Number of pages||11|
|Journal||IEEE Transactions on Geoscience and Remote Sensing|
|Publication status||Published - Oct 2004|
- Convex geometry