Abstract
Spectral unmixing is an important task for hyperspectral data exploitation. It generally consists of two steps: identification of pure spectral signatures (endmembers) and estimation of the fractional abundance of each endmember in each pixel of the scene. A successful algorithm to perform both tasks in simultaneous fashio is the iterative error analysis (IEA) algorithm, which applies an iterative process in which the next endmember to be detected depends on the set of previously extracted ones, which can be computationally expensive for hyperspectral images with a large number of endmembers. In this paper, we propose a new parallel implementation of the IEA algorithm for graphics processing units (GPUs). The proposed implementation is tested on three different GPUs fromNVidia™, and is shown to exhibit real-time performance in the analysis of an Airborne Visible Infra-Red Imaging Spectrometer (AVIRIS) data set collected over the Cuprite mining district in Nevada.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
