Fast GPU algorithms for endmember extraction from hyperspectral images
Authors:
- 1 July 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000631-000636
Abstract
The N-FINDER algorithm is widely used for endmember extraction from hyperspectral images. One of the disadvantages of N-FINDER is that its sequential implementations have long run times due to their relatively large computational complexity. A fast parallel version of N-FINDER is developed in this paper. This version combined with the use of Hyperspectral Image Reduction for Endmember Extraction technique (HIREE) provides an algorithm that is 8 times faster than the original N-FINDER sequential algorithm.Keywords
This publication has 15 references indexed in Scilit:
- Applications of Independent Component Analysis in Endmember Extraction and Abundance Quantification for Hyperspectral ImageryIEEE Transactions on Geoscience and Remote Sensing, 2006
- Parallel Implementation of Endmember Extraction Algorithms From Hyperspectral DataIEEE Geoscience and Remote Sensing Letters, 2006
- ICE: a statistical approach to identifying endmembers in hyperspectral imagesIEEE Transactions on Geoscience and Remote Sensing, 2004
- The sequential maximum angle convex cone (SMACC) endmember model2004
- Spatial/spectral endmember extraction by multidimensional morphological operationsIEEE Transactions on Geoscience and Remote Sensing, 2002
- Endmember bundles: a new approach to incorporating endmember variability into spectral mixture analysisIEEE Transactions on Geoscience and Remote Sensing, 2000
- N-FINDR: an algorithm for fast autonomous spectral end-member determination in hyperspectral data1999
- Comparison of output from ORASIS and pixel purity calculations1998
- Use of filter vectors in hyperspectral data analysis1995
- Detectability of minerals on desert alluvial fans using reflectance spectraJournal of Geophysical Research, 1987