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

DOI10.1109/TIT.2005.860474zbMath1309.94038OpenAlexW2112605393MaRDI QIDQ3546943

Pierre Vandergheynst, Rémi Gribonval

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.860474

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by other special function classes (41A30)

Related Items

When does OMP achieve exact recovery with continuous dictionaries?, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Accuracy of approximations of solutions to Fredholm equations by kernel methods, Greedy and randomized versions of the multiplicative Schwarz method, Can dictionary-based computational models outperform the best linear ones?, Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty, Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data, Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms, Adaptive frame methods for nonlinear variational problems, Analysis of the self projected matching pursuit algorithm, Some comparisons of complexity in dictionary-based and linear computational models, Iterative thresholding for sparse approximations, Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit