Canonical polyadic decomposition of hyperspectral patch tensors - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Canonical polyadic decomposition of hyperspectral patch tensors

(1, 2) , (2) , (2) , (2) , (1) , (1) , (2)
1
2

Abstract

Spectral unmixing (SU) is one of the most important and studied topics in hyperspectral image analysis. By means of spectral unmixing it is possible to decompose a hyperspectral image in its spectral components, the so-called endmembers, and their respective fractional spatial distributions, so-called abundance maps. The Canonical Polyadic (CP) tensor decomposition has proved to be a powerful tool to decompose a tensor data onto a few rank-one terms in a multilinear fashion. Here, we establish the connection between the CP decomposition and the SU problem when the tensor data is built by stacking small patches of the hyperspectral image. It turns out that the CP decomposition of this hyperspectral patch-tensor is equivalent to solving a blind regularized Extended Linear Mixing Model (ELMM).
Fichier principal
Vignette du fichier
EUSIPCO2016.pdf (424.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01382362 , version 1 (17-10-2016)

Identifiers

Cite

Miguel Angel Veganzones, Jérémy E Cohen, Rodrigo Cabral Farias, Konstantin Usevich, Lucas Drumetz, et al.. Canonical polyadic decomposition of hyperspectral patch tensors. EUSIPCO 2016 - 24th European Signal Processing Conference, Aug 2016, Budapest, Hungary. pp.2176-2180, ⟨10.1109/EUSIPCO.2016.7760634⟩. ⟨hal-01382362⟩
336 View
177 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More