Dependent Component Analysis: A Hyperspectral Unmixing Algorithm
Dependent Component Analysis: A Hyperspectral Unmixing Algorithm, Proc Iberian Conf. on Pattern Recognition and Image Analysis, Girona, Spain, Vol. 4478, pp. 612 - 619, June, 2007.
Digital Object Identifier: 10.1007/978-3-540-72849-8_77
Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest.
This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical properties of hyperspectral data. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization
(GEM) type algorithm. The performance of the method is illustrated using simulated and real data.