Real-Time Simplex Growing Algorithms for Hyperspectral Endmember Extraction
Links to Files
Author/Creator
Author/Creator ORCID
Date
Type of Work
Department
Program
Citation of Original Publication
Chang, Chein-I, Chao-Cheng Wu, Chien-Shun Lo, and Mann-Li Chang. “Real-Time Simplex Growing Algorithms for Hyperspectral Endmember Extraction.” IEEE Transactions on Geoscience and Remote Sensing 48, no. 4 (April 2010): 1834–50. https://doi.org/10.1109/TGRS.2009.2034979.
Rights
© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Subjects
Algorithm design and analysis
Chaos
Computational complexity
Councils
Data mining
Endmember extraction algorithm (EEA)
Error analysis
Hyperspectral imaging
Least squares methods
p -Pass automatic target generation process (ATGP)–simplex growing algorithm (SGA)
p-Pass Maximin-SGA
p-Pass Minimax-SGA
p-Pass real-time (RT) SGA (RT SGA)
p-Pass unsupervised fully constrained least squares (UFCLS)-SGA
Remote sensing
Support vector machines
Chaos
Computational complexity
Councils
Data mining
Endmember extraction algorithm (EEA)
Error analysis
Hyperspectral imaging
Least squares methods
p -Pass automatic target generation process (ATGP)–simplex growing algorithm (SGA)
p-Pass Maximin-SGA
p-Pass Minimax-SGA
p-Pass real-time (RT) SGA (RT SGA)
p-Pass unsupervised fully constrained least squares (UFCLS)-SGA
Remote sensing
Support vector machines
Abstract
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.