Learning fast dictionaries for sparse decompositions using low-rank tensor decompositions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2018

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

Résumé

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.pdf (630.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01709343 , version 1

Citer

Cassio Fraga Dantas, Jérémy E Cohen, Rémi Gribonval. Learning fast dictionaries for sparse decompositions using low-rank tensor decompositions. 2018. ⟨hal-01709343v1⟩
554 Consultations
1293 Téléchargements

Partager

Gmail Facebook X LinkedIn More