Efficiency of orthogonal super greedy algorithm under the restricted isometry property
DOI10.1186/s13660-019-2075-xzbMath1504.94070OpenAlexW2946952035WikidataQ127910399 ScholiaQ127910399MaRDI QIDQ2067856
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2075-x
\(m\)-term approximationcompressed sensingrestricted isometry propertyLebesgue-type inequalityorthogonal multi matching pursuitorthogonal super greedy algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Sampling theory in information and communication theory (94A20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the sum of two integral squares in the imaginary quadratic field \(\mathbb Q(\sqrt {-2p})\)
- Orthogonal matching pursuit under the restricted isometry property
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Least angle regression. (With discussion)
- Some remarks on greedy algorithms
- Super greedy type algorithms
- Nonuniform support recovery from noisy random measurements by orthogonal matching pursuit
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Generalized Orthogonal Matching Pursuit
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Compressed sensing
This page was built for publication: Efficiency of orthogonal super greedy algorithm under the restricted isometry property