On the impossibility of uniform sparse reconstruction using greedy methods

MaRDI QIDQ5190161zbMATH OpenFDO

Authors Holger Rauhut

Publication date 12 March 2010

Full work available at URL http://stsip.org/vol07/no2/vol07no2pp197-215.html

zbMATH Keywords

compressed sensinggreedy algorithmsorthogonal matching pursuitrandom samplingsparse recoverythresholdingtrigonometric polynomials

Mathematics Subject Classification ID

Trigonometric polynomials, inequalities, extremal problems (42A05) Sampling theory in information and communication theory (94A20)

Recommendations

• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Random sampling of sparse trigonometric polynomials
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
• Nonuniform sparse recovery with subgaussian matrices

Cited in

(9)

• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Deterministic sampling of sparse trigonometric polynomials
• Sparse polynomial interpolation in Chebyshev bases
• Stability and robustness of weak orthogonal matching pursuits
• Sparse high-dimensional FFT based on rank-1 lattice sampling
• Two algorithms for compressed sensing of sparse tensors
• Sparse Legendre expansions via _1-minimization
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

This page was built for publication: On the impossibility of uniform sparse reconstruction using greedy methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190161)