Keywords
Matching pursuitGreedy algorithmSparse approximationApproximation algorithmRelaxation (psychology)AlgorithmMathematicsApproximation theoryMathematical optimizationComputer scienceCompressed sensingMathematical analysis
Affiliated Institutions
Related Publications
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
This paper demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with $m$ nonzero entries in ...
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
This paper proves best known guarantees for exact reconstruction of a sparse signal f from few non-adaptive universal linear measurements. We consider Fourier measurements (rand...
Atomic Decomposition by Basis Pursuit
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packe...
Compressed sensing
Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible ...
Compressed sensing
Suppose x is an unknown vector in Ropf <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> (a digital image or signal); we pla...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 86
- Issue
- 3
- Pages
- 572-588
- Citations
- 1341
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1341
OpenAlex
Cite This
Joel A. Tropp,
Anna C. Gilbert,
Martin J. Strauss
(2005).
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit.
Signal Processing
, 86
(3)
, 572-588.
https://doi.org/10.1016/j.sigpro.2005.05.030
Identifiers
- DOI
- 10.1016/j.sigpro.2005.05.030