GPU Implementation of Iterative-Constrained Endmember Extraction from Remotely Sensed Hyperspectral Images

Abstract

Hyperspectral unmixing is an important technique for remotely sensed hyperspectral data exploitation. Linear spectral unmixing is frequently used to characterize mixed pixels in hyperspectral data. Over the last few years, many techniques have been proposed for identifying pure spectral signatures (endmembers) in hyperspectral images. The iterated constrained endmembers (ICE) algorithm is an iterative method that uses the linear model to extract endmembers and abundances simultaneously from the data set. This approach does not necessarily require the presence of pixels in the hyperspectral image as it can automatically derive the signatures of endmembers even if these signatures are not present in the data. As it is the case with other endmember identification algorithms, ICE suffers from high computational complexity. In this paper, a complete and scalable adaptation of the ICE algorithm is implemented using the parallel nature of commodity graphics processing units (GPUs). This gives significant speed increase over the traditional ICE method and allows for processing of larger data set with an increased number of endmembers.