Fetching the paper…
Reading the bibliography…
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis.
The widths of certain finite dimensional sets and classes of smooth functions
B. Kashin · 1977
Earlier work this paper cites.
On widths of the Euclidean ball
A. Garnaev and E. Gluskin · 1984
Earlier work this paper cites.
Matching pursuits with time-frequency dictionaries
S. Mallat and Z. Zhang · 1993
Earlier work this paper cites.
Interior Point Polynomial Algorithms in Convex Programming
Y. E. Nesterov and A. S. Nemirovski · 1994
Earlier work this paper cites.
Numerical Methods for Least Squares Problems
Å. Björck · 1996
Earlier work this paper cites.
Introduction to Algorithms
T. Cormen, C. Lesierson, L. Rivest, and C. Stein · 2001
Earlier work this paper cites.
Fast, small-space algorithms for approximate histogram maintenance
A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss · 2002
Earlier work this paper cites.
Near-optimal sparse Fourier representations via sampling
A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. J. Strauss · 2002
Earlier work this paper cites.
Subset Selection in Regression
A. J. Miller · 2002
Earlier work this paper cites.
Approximation of functions over redundant dictionaries using coherence
A. C. Gilbert, M. Muthukrishnan, and M. J. Strauss · 2003
Earlier work this paper cites.
Nonlinear methods of approximation
V. Temlyakov · 2003
Earlier work this paper cites.
Improved sparse approximation over quasi-incoherent dictionaries
J. A. Tropp, A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss · 2003
Earlier work this paper cites.
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
I. Daubechies, M. Defrise, and C. De Mol · 2004
Earlier work this paper cites.
Greed is good: Algorithmic results for sparse approximation
J. A. Tropp · 2004
Cited alongside, same era.
Decoding by linear programming
E. J. Candès and T. Tao · 2005
Cited alongside, same era.
Combinatorial algorithms for compressed sensing
G. Cormode and S. Muthukrishnan · 2005
Cited alongside, same era.
Improved time bounds for near-optimal sparse Fourier representation via sampling
A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss · 2005
Cited alongside, same era.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information
E. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Stable signal recovery from incomplete and inaccurate measurements
E. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright · 2007
Later among the works it cites.
One sketch for all: Fast algorithms for compressed sensing
A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin · 2007
Later among the works it cites.
A method for large-scale ℓ 1 \ell_{1} -regularized least-squares problems with applications in signal processing and statistics
S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky · 2007
Later among the works it cites.
Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit
D. Needell and R. Vershynin · 2007
Later among the works it cites.
Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
D. Needell and R. Vershynin · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Near optimal signal recovery from random projections: Universal encoding strategies?
E. J. Candès and T. Tao · 2006
Cited alongside, same era.
Compressed sensing and best k k -term approximation
A. Cohen, W. Dahmen, and R. DeVore · 2006
Cited alongside, same era.
Compressed sensing
D. L. Donoho · 2006
Cited alongside, same era.
Algorithmic linear dimension reduction in the ℓ 1 \ell_{1} norm for sparse vectors
A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin · 2006
Cited alongside, same era.
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
M. Rudelson and R. Vershynin · 2006
Cited alongside, same era.
Sparse solution of underdetermined linear equations by stagewise Orthogonal Matching Pursuit (StOMP)
D. L. Donoho, Y. Tsaig, I. Drori, and J.-L. Starck · 2007
Cited alongside, same era.
Beyond Nyquist: Efficient sampling of sparse, bandlimited signals
J. A. Tropp · 2007
Later among the works it cites.
Signal recovery from random measurements via orthogonal matching pursuit
J. A. Tropp and A. C. Gilbert · 2007
Later among the works it cites.
The restricted isometry property and its implications for compressed sensing
E. J. Candès · 2008
Closest in time.
Subspace pursuit for compressive sensing: Closing the gap between performance and complexity
W. Dai and O. Milenkovic · 2008
Closest in time.
A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods
M. Iwen · 2008
Closest in time.
Personal communication, Feb. 2008
A. Pajor · 2008
Closest in time.
Sampling bounds for sparse support recovery in the presence of noise
G. Reeves and M. Gastpar · 2008
Closest in time.