Dictionary-based Tensor Canonical Polyadic Decomposition
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Apr 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 1.
4 papers.
- 2024Tensor Decomposition with Unaligned Observations17 Oct 2024
- 2023Multi-Dictionary Tensor Decomposition18 Sep 2023
- 2021Dictionary-based Low-Rank Approximations and the Mixed Sparse Coding problem24 Nov 2021
- 2021Multi-Channel Automatic Music Transcription Using Tensor Algebra23 Jul 2021