Title: Does a simplex formed by endmembers really yield maximal volume?

Authors: Chao-Cheng Wu; Chein-I Chang

Addresses: Department of Electrical Engineering, National Taipei University of Technology, 1, Sec. 3, Zhongxiao E. Rd., Taipei 106, Taiwan ' Remote Sensing Signal and Image Processing Laboratory, Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, Baltimore, MD 21250, USA

Abstract: One of commonly used criteria for finding an endmember set is based on the fact that for a given number of endmembers, p, a p-vertex simplex with its all p vertices specified by endmembers always yields the maximal volume. Since there are also other criteria that have been used for endmember extraction, an interesting issue arises: 'Does a p-vertex simplex with its all vertices specified by p endmembers really produce maximal volume?' In other words, 'Is the maximal simplex volume a better and more effective measure than other criteria currently being used by endmember extraction such as orthogonal projection, least squares error, etc.?' This paper explores this issue by investigating a number of popular endmember extraction algorithms designed by various criteria via a comparative study and analysis through real image experiments.

Keywords: automatic target generation process; ATGP; endmember extraction; sequential N-FINDR; SQ N-FINDR; unsupervised fully constrained least squares; UFCLS; simplex growing algorithm; SGA; vertex component analysis; VCA.

DOI: 10.1504/IJCSE.2013.055359

International Journal of Computational Science and Engineering, 2013 Vol.8 No.3, pp.274 - 280

Received: 21 Oct 2012
Accepted: 21 Oct 2012
Published online: 27 Dec 2013 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article