Learning Dependent Sources using Mixtures of Dirichlet: Applications on Hyperspectral Unmixing
Learning Dependent Sources using Mixtures of Dirichlet: Applications on Hyperspectral Unmixing, Proc IEEE Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing - WHISPERS, Grenoble, France, Vol. -, pp. 1 - 5, August, 2009.
Digital Object Identifier: 10.1109/WHISPERS.2009.5288975
This paper is an elaboration of the DECA algorithm  to blindly unmix hyperspectral data. The underlying mixing model is linear, meaning that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. The proposed method, as DECA, is tailored to highly mixed mixtures in which the geometric based approaches fail to identify the simplex of minimum volume enclosing the observed spectral vectors. We resort then to a statitistical framework, where the abundance fractions are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum.
With respect to DECA, we introduce two improvements:
1) the number of Dirichlet modes are inferred based on the minimum description length (MDL) principle; 2) The generalized expectation maximization (GEM) algorithm we adopt to infer the model parameters is improved by using alternating minimization and augmented Lagrangian methods to compute the mixing matrix. The effectiveness of the proposed algorithm is illustrated with simulated and read data.