Abstract:

An endmember detection algorithm that simultaneously partitions an input data set into distinct contexts, estimates endmembers, number of endmembers, and abundances for each partition is presented. In contrast to previous endmember detection algorithms based on the convex geometry model, this method is capable of describing non-convex sets of hyperspectral pixels. Endmembers are found for non-convex regions by partitioning the set of pixels into convex regions using the Dirichlet process and determining unique endmembers for each region. This novel endmember detection method naturally produces a classifier with a reject class. The algorithm can effectively identify to which context a test data point belongs and identify test pixels for which the associated context is unknown. Results are shown on AVIRIS Indian Pines hyperspectral data. The results show the classification capability of this context-based endmember algorithm.

Links:

Citation:

A. Zare and P. Gader, “Context-based endmember detection for hyperspectral imagery,” in 1st IEEE Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS), 2009. 

@InProceedings{zare2009context,
Title = {Context-based endmember detection for hyperspectral imagery},
Author = {Alina Zare and Paul Gader},
Booktitle = {1st IEEE Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS)},
Year = {2009},
Month = {Aug.},
Doi = {10.1109/WHISPERS.2009.5288993},
}