Learning Analysis Sparsity Priors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Learning Analysis Sparsity Priors

Résumé

This paper introduces a novel approach to learn a dictionary in a sparsity-promoting analysis-type prior. The dictionary is opti- mized in order to optimally restore a set of exemplars from their degraded noisy versions. Towards this goal, we cast our prob- lem as a bilevel programming problem for which we propose a gradient descent algorithm to reach a stationary point that might be a local minimizer. When the dictionary analysis operator specializes to a convolution, our method turns out to be a way of learning generalized total variation-type prior. Applications to 1-D signal denoising are reported and potential applicability and extensions are discusses.
Fichier principal
Vignette du fichier
PeyreFadiliSampta11.pdf (141.49 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00542016 , version 1 (01-12-2010)

Identifiants

  • HAL Id : hal-00542016 , version 1

Citer

Gabriel Peyré, Jalal M. Fadili. Learning Analysis Sparsity Priors. Sampta'11, 2011, Singapour, Singapore. 4 pp. ⟨hal-00542016⟩
818 Consultations
859 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More