Hierarchical Bayesian sparse source separation of hyperspectral signals

We consider the separation of signals having a simplex constraint based on observations of noisy data using a fully Bayesian result. A joint density for the abundances (the simplex-constrained signal) is established. To specifically allow for the abundances to be sparse, this joint density is endowed with a parameter which is parameterized to encourage sparseness, unlike related previous work which did not specifically impose the sparsity assumption. Overall, a Gibbs sampling framework is established from which all parameters can be learned. A Metropolis sampling framework is developed for the abundances (mixture coefficients) which explicitly and efficiently represents the sparseness. For the parameter of the Dirichlet distribution governing sparseness, the posterior is shown to be closely approximated by a Gamma. Thus the entire set of parameters can be efficiently learned by sampling.

[1]  George Eastman House,et al.  Sparse Bayesian Learning and the Relevan e Ve tor Ma hine , 2001 .

[2]  J. Boardman Automating spectral unmixing of AVIRIS data using convex geometry concepts , 1993 .

[3]  Todd K. Moon,et al.  Detection of Amorphously Shaped Objects Using Spatial Information Detection Enhancement (SIDE) , 2012, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[4]  J.-Y. Tourneret,et al.  Subspace-based Bayesian blind source separation for hyperspectral imagery , 2009, 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

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

[6]  José M. Bioucas-Dias,et al.  Hyperspectral Unmixing Based on Mixtures of Dirichlet Components , 2012, IEEE Transactions on Geoscience and Remote Sensing.

[7]  Anthony J. Ratkowski,et al.  The sequential maximum angle convex cone (SMACC) endmember model , 2004, SPIE Defense + Commercial Sensing.

[8]  Chong-Yung Chi,et al.  A Simplex Volume Maximization Framework for Hyperspectral Endmember Extraction , 2011, IEEE Transactions on Geoscience and Remote Sensing.

[9]  Robert F. Cromp,et al.  Analyzing hyperspectral data with independent component analysis , 1998, Other Conferences.

[10]  Alfred O. Hero,et al.  Joint Bayesian Endmember Extraction and Linear Unmixing for Hyperspectral Imagery , 2009, IEEE Transactions on Signal Processing.

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

[12]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[13]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[14]  Antonio J. Plaza,et al.  Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches , 2012, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[15]  John Aitchison,et al.  The Statistical Analysis of Compositional Data , 1986 .

[16]  Michael Möller,et al.  A Convex Model for Matrix Factorization and Dimensionality Reduction on Physical Space and Its Application to Blind Hyperspectral Unmixing , 2010 .

[17]  Antonio J. Plaza,et al.  Sparse Unmixing of Hyperspectral Data , 2011, IEEE Transactions on Geoscience and Remote Sensing.

[18]  C. Robert Simulation of truncated normal variables , 2009, 0907.4010.

[19]  Chein-I Chang,et al.  A New Growing Method for Simplex-Based Endmember Extraction Algorithm , 2006, IEEE Transactions on Geoscience and Remote Sensing.