Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach

Résumé

A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coefficients and dictionary, when the approximation error is small or zero, algorithm convergence will be slow or non-existent. The proposed framework can be used in such a setting by gradually increasing the fidelity of the approximation. This technique has previously been used for the convex sparse representations. It has been extended here to the non-convex dictionary learning problem by allowing the dictionary be modified.
Fichier non déposé

Dates et versions

inria-00567528 , version 1 (21-02-2011)

Identifiants

  • HAL Id : inria-00567528 , version 1

Citer

Mehrdad Yaghoobi, Mike E. Davies. Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach. Vigneron, Vincent and Zarzoso, Vicente and Moreau, Eric and Gribonval, Rémi and Vincent, Emmanuel. Latent Variable Analysis and Signal Separation, 6365, Springer Berlin / Heidelberg, pp.410-417, 2010. ⟨inria-00567528⟩
51 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More