The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
From MaRDI portal
(Redirected from Publication:5094726)
Recommendations
- Sparsity and incoherence in orthogonal matching pursuit
- Recovery of sparse signals by orthogonal multi-matching pursuit
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- A sufficient condition for sparse signals' exact recovery by using OMP algorithm
- Tight recovery guarantees for orthogonal matching pursuit under Gaussian noise
Cites work
- _1 minimization with noisy data
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- A mathematical introduction to compressive sensing
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- Adaptive greedy approximations
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Compressed sensing and best \(k\)-term approximation
- Compressed sensing: a survey
- Compressive sensing and structured random matrices
- Deterministic sampling of sparse trigonometric polynomials
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 3139051 (Why is no real title available?)
- Interpolation via weighted \(\ell_{1}\) minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On singular values of matrices with independent rows
- On sparse interpolation and the design of deterministic interpolation points
- Orthogonal matching pursuit under the restricted isometry property
- Orthogonal polynomials of several variables
- Random sampling of sparse trigonometric polynomials
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Some new characterizations of the Chebyshev polynomials
- Some remarks on greedy algorithms
- Sparse Legendre expansions via _1-minimization
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse representations in unions of bases
- Sparse Solutions of Underdetermined Linear Systems and Their Applications
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
Cited in
(8)- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- When does OMP achieve exact recovery with continuous dictionaries?
- Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- On the impossibility of uniform sparse reconstruction using greedy methods
- Piecewise sparse recovery via piecewise greedy method
- On Theorem 10 in “On Polar Polytopes and the Recovery of Sparse Representations” [Sep 07 3188-3195]
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
This page was built for publication: The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094726)
