Real-time processing of simplex growing algorithm

Abstract

Simplex growing algorithm (SGA) was recently developed as an alternative to the N-finder algorithm (N-FINDR) which is shown to be a promising endmember extraction technique. This paper further extends the SGA to a real-time processing algorithm, referred to as real-time SGA (RT SGA) that can effectively address four major issues arising in practical implementation for N-FINDR, (1) use of random initial endmembers which causes inconsistent final results, (2) very high computational complexity which results from an exhaustive search for finding all endmembers simultaneously, (3) requirement of dimensionality reduction because of enormous data volumes to be processed and (4) lack of real-time capability.