On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

Authors:
R. Gribonval;P. Vandergheynst
Affiliations:
IRISA/INRIA, France;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 19

Image compression using an edge adapted redundant dictionary and wavelets

Signal Processing - Sparse approximations in signal and image processing
Video coding using 3D dual-tree wavelet transform

Journal on Image and Video Processing
Hybrid video coding based on bidimensional matching pursuit

EURASIP Journal on Applied Signal Processing
A neural network pruning approach based on compressive sampling

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Weight-decay regularization in reproducing Kernel Hilbert spaces by variable-basis schemes

WSEAS Transactions on Mathematics
Stagewise weak gradient pursuits

IEEE Transactions on Signal Processing
Parametric dictionary design for sparse coding

IEEE Transactions on Signal Processing
Regularization techniques and suboptimal solutions to optimization problems in learning from data

Neural Computation
Block-sparse signals: uncertainty relations and efficient recovery

IEEE Transactions on Signal Processing
Some comparisons of model complexity in linear and neural-network approximation

ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part III
Some comparisons of complexity in dictionary-based and linear computational models

Neural Networks
Kernel networks with fixed and variable widths

ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Bounds for approximate solutions of Fredholm integral equations using kernel networks

ICANN'11 Proceedings of the 21th international conference on Artificial neural networks - Volume Part I
Matching Pursuits with random sequential subdictionaries

Signal Processing
2011 Special Issue: Can dictionary-based computational models outperform the best linear ones?

Neural Networks
Heteroscedastic Sparse Representation Based Classification for Face Recognition

Neural Processing Letters
Some comparisons of networks with radial and kernel units

ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II
Sparse coding with adaptive dictionary learning for underdetermined blind speech separation

Speech Communication
A hybrid simulated annealing thresholding algorithm for compressed sensing

Signal Processing

Quantified Score

Hi-index	754.85

Visualization

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.