Error estimates for orthogonal matching pursuit and random dictionaries
DOI10.1007/s00365-010-9122-7zbMath1218.41008OpenAlexW2057380028MaRDI QIDQ628676
Paweł Bechler, Przemysław Wojtaszczyk
Publication date: 14 March 2011
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-010-9122-7
coherencenonlinear approximationorthogonal matching pursuitrestricted isometry propertyLebesgue inequalitiesrandom dictionaries
Inequalities involving eigenvalues and eigenvectors (15A42) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Unnamed Item
- A simple proof of the restricted isometry property for random matrices
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Projection pursuit
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- On Lebesgue-type inequalities for greedy approximation
- Compressed sensing and best 𝑘-term approximation
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy approximation
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- The main triangle projection in matrix spaces and its applications
- Compressed sensing
- An introduction to frames and Riesz bases
This page was built for publication: Error estimates for orthogonal matching pursuit and random dictionaries
