Skip to Main content Skip to Navigation
Journal articles

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

Rémi Gribonval 1 Pierre Vandergheynst 2 
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Rémi Gribonval Connect in order to contact the contributor
Submitted on : Saturday, December 11, 2010 - 5:31:34 PM
Last modification on : Friday, February 4, 2022 - 3:18:27 AM
Long-term archiving on: : Saturday, March 12, 2011 - 2:25:17 AM


Publisher files allowed on an open archive



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



Record views


Files downloads