Dependent component analysis: a hyperspectral unmixing algorithm


Autoria(s): Nascimento, José M. P.; Bioucas-Dias, José M.
Data(s)

05/06/2014

05/06/2014

01/06/2007

Resumo

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.

Identificador

NASCIMENTO, José M. P.; BIOUCAS-DIAS, José M. - Dependent Component Analysis: A Hyperspectral Unmixing Algorithm. Pattern Recognition and Image Analysis. Vol. 4478 (2007), p. 612-619.

978-3-540-72848-1

978-3-540-72849-8

10.1007/978-3-540-72849-8_77

http://hdl.handle.net/10400.21/3611

Idioma(s)

eng

Publicador

Springer Berlin Heidelberg

Relação

Lecture Notes in Computer Science;

http://link.springer.com/chapter/10.1007%2F978-3-540-72849-8_77

Direitos

restrictedAccess

Palavras-Chave #Hyperspectral unmixing algorithm
Tipo

bookPart