Dictionary-Based Tensor Canonical Polyadic Decomposition

DOI10.1109/TSP.2017.2777393MaRDI QIDQ4621704zbMATH OpenOpenAlexFDO

Authors Jeremy Cohen, Nicolas Gillis

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.00541

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Abstract: To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictionary-based canonical polyadic decomposition. The benefits of using a dictionary in tensor decomposition models are explored both in terms of parameter identifiability and estimation accuracy. Performances of the proposed algorithms are evaluated on the decomposition of simulated data and the unmixing of hyperspectral images.

Cited in

(2)

• MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
• Tensor decomposition with unaligned observations

This page was built for publication: Dictionary-Based Tensor Canonical Polyadic Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621704)