On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2006

On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries

Abstract

The purpose of this correspondence is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit (MP) with some structured dictionaries for "simple" functions in finite or infinite dimension. The results are based on an extension of Tropp's results about Orthogonal Matching Pursuit (OMP) in finite dimension, with the observation that it does not only work for OMP but also for MP. The main contribution is a detailed analysis of the approximation and stability properties of MP with quasi-incoherent dictionaries, and a bound on the number of steps sufficient to reach an error no larger than a penalization factor times the best m-term approximation error.
Fichier principal
Vignette du fichier
2006_IEEE_TIT_GribVandergheynst_ExponMP.pdf (273.35 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00544945 , version 1 (11-12-2010)

Identifiers

Cite

Rémi Gribonval, Pierre Vandergheynst. On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries. IEEE Transactions on Information Theory, 2006, 52 (1), pp.255--261. ⟨10.1109/TIT.2005.860474⟩. ⟨inria-00544945⟩
208 View
781 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More