Skip to Main content Skip to Navigation
Book sections

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

Abstract : 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.
Document type :
Book sections
Complete list of metadata

https://hal.inria.fr/inria-00567528
Contributor : Jules Espiau De Lamaestre Connect in order to contact the contributor
Submitted on : Monday, February 21, 2011 - 2:11:01 PM
Last modification on : Wednesday, November 24, 2021 - 9:54:07 AM

Identifiers

  • HAL Id : inria-00567528, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

43