Abstract
Several of the more important endmember-finding algorithms for hyperspectral data are discussed and their short-comings highlighted. A new algorithm, ICE, which attempts to overcome these shortcomings is introduced. An example of its use is given.
Original language | English |
---|---|
Title of host publication | International Geoscience and Remote Sensing Symposium (IGARSS) |
Pages | 279-283 |
Number of pages | 5 |
Volume | 1 |
Publication status | Published - 2003 |
Externally published | Yes |
Event | IEEE International Geoscience and Remote Sensing Symposium 2003 - Toulouse, France Duration: 21 Jul 2003 → 25 Jul 2003 https://ieeexplore.ieee.org/xpl/conhome/9010/proceeding?isnumber=28601 (Proceedings) |
Conference
Conference | IEEE International Geoscience and Remote Sensing Symposium 2003 |
---|---|
Abbreviated title | IGARSS 2003 |
Country | France |
City | Toulouse |
Period | 21/07/03 → 25/07/03 |
Internet address |