By Topic

Real-Time Simplex Growing Algorithms for Hyperspectral Endmember Extraction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chein-I Chang ; Dept. of Comput. Sci. & Electr. Eng., Univ. of Maryland, Baltimore, MD, USA ; Chao-Cheng Wu ; Chien Shun Lo ; Mann-Li Chang

The simplex growing algorithm (SGA) was recently developed as an alternative to the N-finder algorithm (N-FINDR) and shown to be a promising endmember extraction technique. This paper further extends the SGA to a versatile real-time (RT) processing algorithm, referred to as RT SGA, which can effectively address the following four major issues arising in the practical implementation for N-FINDR: (1) use of random initial endmembers which causes inconsistent final results; (2) high computational complexity which results from an exhaustive search for finding all endmembers simultaneously; (3) requirement of dimensionality reduction because of large data volumes; and (4) lack of RT capability. In addition to the aforementioned advantages, the proposed RT SGA can also be implemented by various criteria in endmember extraction other than the maximum simplex volume.

Published in:

Geoscience and Remote Sensing, IEEE Transactions on  (Volume:48 ,  Issue: 4 )