Convex geometry based estimation of number of endmembers in hyperspectral images

Hyperspectral unmixing is a process of decomposing the hyperspectral data cube into endmember signatures and their corresponding abundance maps. For the unmixing results to be completely interpretable, the number of materials (or endmembers) present in that area should be known a priori, which however is unknown in practice. In this work, we use hyperspectral data geometry and successive endmember estimation strategy of an endmember extraction algorithm (EEA) to develop two novel algorithms for estimating the number of endmembers, namely geometry based estimation of number of endmembers - convex hull (GENE-CH) algorithm and affine hull (GENE-AH) algorithm. The proposed GENE algorithms estimate the number of endmembers by using Neyman-Pearson hypothesis testing over the endmembers sequentially estimated by an EEA until the estimate of the number of endmembers is obtained. Monte- Carlo simulations demonstrate the efficacy of the proposed GENE algorithms, compared to some existing benchmark methods for estimating number of endmembers.

[1]  Chong-Yung Chi,et al.  Chance-Constrained Robust Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing , 2011, IEEE Transactions on Geoscience and Remote Sensing.

[2]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[3]  H. Akaike A new look at the statistical model identification , 1974 .

[4]  Chein-I Chang,et al.  Estimation of number of spectrally distinct signal sources in hyperspectral imagery , 2004, IEEE Transactions on Geoscience and Remote Sensing.

[5]  C Harsanyi Joseph,et al.  Determining the number and identity of spectral endmembers; an integrated approach using Neyman-Person eigen-thresholding and iterative constrained RMS error minimization , 1993 .

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Chong-Yung Chi,et al.  Two effective and computationally efficient pure-pixel based algorithms for hyperspectral endmember extraction , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  R. E. Wheeler Statistical distributions , 1983, APLQ.

[9]  M. Evans Statistical Distributions , 2000 .

[10]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[11]  José M. P. Nascimento,et al.  Signal subspace identification in hyperspectral imagery , 2012 .

[12]  José M. Bioucas-Dias,et al.  Hyperspectral Subspace Identification , 2008, IEEE Transactions on Geoscience and Remote Sensing.

[13]  Lonnie C. Ludeman Random Processes: Filtering, Estimation, and Detection , 2003 .

[14]  R. Clark,et al.  The U. S. Geological Survey, Digital Spectral Library: Version 1 (0.2 to 3.0um) , 1993 .

[15]  W. H. Farrand,et al.  Determining the number and identity of spectral endmembers; an integrated approach using Neyman-Person eigen-thresholding and iterative constrained RMS error minimization , 1993 .

[16]  G. Arfken Mathematical Methods for Physicists , 1967 .

[17]  G. Schwarz Estimating the Dimension of a Model , 1978 .