On the incorporation of spatial information to endmember identification algorithms without the pure pixel assumption

Spectral unmixing is a commonly used technique in hyperspectral data exploitation. It expresses the measured spectral signature of each pixel in the data as a combination of spectrally pure constituent spectra, called endmembers, and a set of correspondent fractions, or abundances that indicate the proportion of each endmember present in the mixture. Over the last years, several algorithms have been developed for automatic endmember identification by assuming the presence of at least one pure spectral signature for each distinct material. However, this assumption often does not hold in practice due to spatial resolution, mixing phenomena, and other considerations. In this paper, we investigate if spatial information can assist the endmember searching process conducted by algorithms that do not assume the presence of pure pixels in the hyperspectral data. For this purpose, we use recently developed spatial pre-processing techniques that do not require modifications in the subsequent endmember identification process, conducted in this work using minimum volume enclosing algorithms. Our experimental results, conducted using both simulated and real hyperspectral data sets, reveal that spatial information can be beneficial to guide the endmember identification process when pure pixels are not assumed to be present in the hyperspectral data.

[1]  Antonio J. Plaza,et al.  Region-Based Spatial Preprocessing for Endmember Extraction and Spectral Unmixing , 2011, IEEE Geoscience and Remote Sensing Letters.

[2]  José M. Bioucas-Dias,et al.  A variable splitting augmented Lagrangian approach to linear spectral unmixing , 2009, 2009 First Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing.

[3]  S. J. Sutley,et al.  Imaging spectroscopy: Earth and planetary remote sensing with the USGS Tetracorder and expert systems , 2003 .

[4]  John A. Richards,et al.  Remote Sensing Digital Image Analysis: An Introduction , 1999 .

[5]  Hairong Qi,et al.  Endmember Extraction From Highly Mixed Data Using Minimum Volume Constrained Nonnegative Matrix Factorization , 2007, IEEE Transactions on Geoscience and Remote Sensing.

[6]  John F. Mustard,et al.  Spectral unmixing , 2002, IEEE Signal Process. Mag..

[7]  Antonio J. Plaza,et al.  Spatial Preprocessing for Endmember Extraction , 2009, IEEE Transactions on Geoscience and Remote Sensing.

[8]  Jean-Yves Tourneret,et al.  Bayesian Estimation of Linear Mixtures Using the Normal Compositional Model. Application to Hyperspectral Imagery , 2010, IEEE Transactions on Image Processing.

[9]  Chong-Yung Chi,et al.  A convex analysis-based minimum-volume enclosing simplex algorithm for hyperspectral unmixing , 2009, IEEE Trans. Signal Process..

[10]  José M. Bioucas-Dias,et al.  Minimum Volume Simplex Analysis: A Fast Algorithm to Unmix Hyperspectral Data , 2008, IGARSS 2008 - 2008 IEEE International Geoscience and Remote Sensing Symposium.

[11]  Mario Winter,et al.  N-FINDR: an algorithm for fast autonomous spectral end-member determination in hyperspectral data , 1999, Optics & Photonics.

[12]  Chong-Yung Chi,et al.  A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing , 2009, IEEE Transactions on Signal Processing.

[13]  Chein-I Chang,et al.  Hyperspectral image classification and dimensionality reduction: an orthogonal subspace projection approach , 1994, IEEE Trans. Geosci. Remote. Sens..

[14]  José M. Bioucas-Dias,et al.  Vertex component analysis: a fast algorithm to unmix hyperspectral data , 2005, IEEE Transactions on Geoscience and Remote Sensing.

[15]  Maurice D. Craig,et al.  Minimum-volume transforms for remotely sensed data , 1994, IEEE Trans. Geosci. Remote. Sens..