Dependent component analysis: A hyperspectral unmixing algorithm

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Nascimento, J. M. P., & Bioucas-Dias, J. M. (2007). Dependent component analysis: A hyperspectral unmixing algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4478 LNCS, pp. 612–619). Springer Verlag. https://doi.org/10.1007/978-3-540-72849-8_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free