Chasing butterflies: In search of efficient dictionaries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Chasing butterflies: In search of efficient dictionaries

Résumé

Dictionary learning aims at finding a frame (called dictionary) in which training data admits a sparse representation. Traditional dictionary learning is limited to relatively small-scale problems, because dense matrices associated to high-dimensional dictionaries can be costly to manipulate, both at the learning stage and when using this dictionary for tasks such as sparse coding. In this paper, inspired by usual fast transforms, we consider a dictionary structure allowing cheaper manipulation, and we propose a learning algorithm imposing this structure. The approach is demonstrated experimentally with the factorization of the Hadamard matrix and on image denoising.
Fichier principal
Vignette du fichier
ICASSP_current.pdf (970.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01104696 , version 1 (19-01-2015)
hal-01104696 , version 2 (23-01-2015)

Identifiants

Citer

Luc Le Magoarou, Rémi Gribonval. Chasing butterflies: In search of efficient dictionaries. International Conference on Acoustics, Speech and Signal Processing (ICASSP), Apr 2015, Brisbane, Australia. ⟨10.1109/ICASSP.2015.7178579⟩. ⟨hal-01104696v2⟩
1012 Consultations
985 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More