Improved Process for Use of a Simplex Growing Algorithm for Endmember Extraction

Abstract

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> A recent paper by Chang <etal/> develops a new algorithm, called the simplex growing algorithm, which has shown promise in endmember extraction. There is an erroneous description made for one of synthetic image experiments. While making a simple correction would have sufficed, a series of studies has led to interesting and intriguing results on how to determine an appropriate number of endmembers <formula formulatype="inline"><tex Notation="TeX">$p$ </tex></formula>, how to design a better endmember extraction algorithm, and how to use an effective technique to perform dimensionality reduction. </para>