Learning fast dictionaries for sparse representations using low-rank tensor decompositions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Learning fast dictionaries for sparse representations using low-rank tensor decompositions

Abstract

A new dictionary learning model is introduced where the dictionary matrix is constrained as a sum of R Kronecker products of K terms. It offers a more compact representation and requires fewer training data than the general dictionary learning model, while generalizing Tucker dictionary learning. The proposed Higher Order Sum of Kroneckers model can be computed by merging dictionary learning approaches with the tensor Canonic Polyadic Decomposition. Experiments on image denoising illustrate the advantages of the proposed approach.
Fichier principal
Vignette du fichier
notes (1).pdf (631.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01709343 , version 1 (14-02-2018)
hal-01709343 , version 2 (27-04-2018)

Identifiers

Cite

Cassio Fraga Dantas, Jérémy E Cohen, Rémi Gribonval. Learning fast dictionaries for sparse representations using low-rank tensor decompositions. LVA/ICA 2018 - 14th International Conference on Latent Variable Analysis and Signal Separation, Jul 2018, Guildford, United Kingdom. pp.456-466, ⟨10.1007/978-3-319-93764-9_42⟩. ⟨hal-01709343v2⟩
558 View
1351 Download

Altmetric

Share

Gmail Facebook X LinkedIn More