Fetching the paper…
Reading the bibliography…
Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately.
P.J. Huber, Robust estimation of a location parameter , The Annals of Mathematical Statistics 35
1964
Earlier work this paper cites.
C. L. Mallows, Minimizing an integral , SIAM Review 20
1978
Earlier work this paper cites.
P. Bickel, Minimax estimation of the mean of a normal distribution when the parameter space is restricted , Annals of Statistics 9
1981
Earlier work this paper cites.
L.D. Brown., I.M. Johnstone, and K.B. MacGibbon, Variation diminishing transformations: A direct approach to total positivity and its statistical applications , Journal of the American Statistical Association 76
1981
Earlier work this paper cites.
G. Casella and W. E. Strawderman, Estimating a bounded normal mean , Annals of Statistics 9
1981
Earlier work this paper cites.
P. Bickel and J. Collins, Minimizing fisher information over mixtures of distributions , Sankhya A 45
1983
Earlier work this paper cites.
M.J. Best and N. Chakravarti, Active set algorithms for isotonic regression; a unifying framework , Mathematical Programming 47
1990
Earlier work this paper cites.
J.C. Hoch D.L. Donoho, I.M. Johnstone and A.S. Stern, Maximum entropy and the nearly black object (with discussion) , J. Roy. Statist. Soc. B 54
1992
Earlier work this paper cites.
L. I. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms , Physica D: Nonlinear Phenomena 60
1992
Earlier work this paper cites.
D. L. Donoho and I. M. Johnstone, Minimax risk over l p l_{p} balls , Prob. Th. and Rel. Fields 99
1994
Earlier work this paper cites.
I. M. Johnstone, Minimax bayes, asymptotic minimax and sparse wavelet priors , Statistical Decision Theory and Related Topics, V (S.S. Gupta and eds. J.O. Berger, eds.), Springer-Verlag, 1994, p. 303–326
1994
Earlier work this paper cites.
I.M. Johnstone, On minimax estimation of a sparse normal mean vector , Annals of Statistics 22
1994
Earlier work this paper cites.
D.L. Donoho and I.M. Johnstone, Adapting to unknown smoothness via wavelet shrinkage , J. Amer. Statist. Assn. 90
1995
Earlier work this paper cites.
C. R. Vogel and M. E. Oman, Iterative methods for total variation denoising , SIAM J. Sci. Comput 17
1996
Earlier work this paper cites.
H.-Y. Gao and A.G. Bruce, Waveshrink with firm shrinkage , Statistica Sinica 7
1997
Earlier work this paper cites.
P. Hall, G. Kerkyacharian, and D. Picard, Block threshold rules for curve estimation using kernel and wavelet methods , Ann. Statist. 26
1998
Earlier work this paper cites.
T.T. Cai, Adaptive wavelet estimation: A block thresholding and oracle inequality approach , The Annals of Statistics 27
1999
Earlier work this paper cites.
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, Model-Based Compressive Sensing , IEEE Trans. on Inform. Theory 56
2001
Earlier work this paper cites.
E. J. Candés and T. Tao, Decoding by linear programming , IEEE Trans. on Inform. Theory 51
2005
Earlier work this paper cites.
D. L. Donoho and J. Tanner, Neighborliness of randomly-projected simplices in high dimensions , Proceedings of the National Academy of Sciences 102
2005
Earlier work this paper cites.
E. Candès, Compressive sampling , Proceedings of the International Congress of Mathematicians (Madrid, Spain), 2006
2006
Earlier work this paper cites.
D. L. Donoho, High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension , Discrete Comput. Geometry 35
2006
Earlier work this paper cites.
R. Berinde, A.C. Gilbert, P. Indyk, H. Karloff, and M.J. Strauss, Combining geometry and combinatorics: A unified approach to sparse signal recovery , 47th Annual Allerton Conference (Monticello, IL), September 2008, pp. 798 – 805
2008
Cited alongside, same era.
V. Cevher, C. Hegde, M. F. Duarte, and R. G. Baraniuk, Sparse Signal Recovery Using Markov Random Fields , Neural Information Processing Systems (Vancouver), December 2008
2008
Cited alongside, same era.
R. Chartrand and W. Yin, Iteratively reweighted algorithms for compressive sensing , ICASSP, IEEE, 2008, pp. 3869–3872
2008
Cited alongside, same era.
M. Fornasier and H. Rauhut, Iterative thresholding algorithms , Appl. and Comp. Harmonic Analysis 25
2008
Cited alongside, same era.
T.J. Richardson and R. Urbanke, Modern Coding Theory , Cambridge University Press, Cambridge, 2008
2008
S. Som, L. C. Potter, and P. Schniter, Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior , Proc. Asilomar Conf. on Signals, Systems, and Computers, November 2010
2010
Later among the works it cites.
L.C. Potter S. Som and P. Schniter, On Approximate Message Passing for Reconstruction of Non-Uniformly Sparse Signals , Proceedings of the National Aereospace and Electronics Conference (Dayton, OH), 2010
2010
Later among the works it cites.
M. Stojnic, Block-length dependent thresholds for 2/1-optimization in block-sparse compressed sensing , ICASSP, IEEE, 2010, pp. 3918–3921
2010
Later among the works it cites.
Y. Wu and S. Verdú, Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression , IEEE Trans. on Inform. Theory 56
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
P. J. Bickel, Y. Ritov, and A. B. Tsybakov, Simultaneous analysis of Lasso and Dantzig selector , Amer. J. of Mathematics 37
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, Message passing algorithms for compressed sensing , Proceedings of the National Academy of Sciences 106
2009
Cited alongside, same era.
D.L. Donoho and J. Tanner, Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing , Phil. Trans. R. Soc. A 367
2009
Cited alongside, same era.
P.J. Huber and E. Ronchetti, Robust statistics (second edition) , J. Wiley and Sons, 2009
2009
Cited alongside, same era.
Y. Kabashima, T. Wadayama, and T. Tanaka, A typical reconstruction limit for compressed sensing based on lp-norm minimization , J.Stat. Mech. (2009), L09003
2009
Cited alongside, same era.
M. Mézard and A. Montanari, Information, Physics and Computation , Oxford University Press, Oxford, 2009
2009
Cited alongside, same era.
S. Rangan, A. K. Fletcher, and V. K. Goyal, Asymptotic analysis of map estimation via the replica method and applications to compressed sensing , Neural Information Processing Systems (NIPS) (Vancouver), 2009
2009
Cited alongside, same era.
2010
Later among the works it cites.
2010
Later among the works it cites.
J. D. Blanchard, C. Cartis, and J. Tanner, Compressed sensing: How sharp is the restricted isometry property? , SIAM Review 53
2011
Closest in time.
M. Bayati and A. Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Trans. on Inform. Theory 57
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
D.L. Donoho, A. Maleki, and A. Montanari, The Noise Sensitivity Phase Transition in Compressed Sensing , IEEE Trans. on Inform. Theory 57
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
S. Rangan, Generalized Approximate Message Passing for Estimation with Random Linear Mixing , IEEE Intl. Symp. on Inform. Theory (St. Petersbourg), August 2011
2011
Closest in time.
2011
Closest in time.
2012
Closest in time.
D.L. Donoho, I. Johnstone, and A. Montanari, Amp public svn repository , https://subversion.assembla.com/svn/amp_public/, November 2012
2012
Closest in time.
A. Javanmard and A. Montanari, State Evolution for Vector Approximate Message Passing , In preparation, 2012
2012
Closest in time.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborova, Statistical physics-based reconstruction in compressed sensing , Phys.Rev X 2
2012
Closest in time.
A. Montanari, Graphical models concepts in compressed sensing , Compressed Sensing (Y.C. Eldar and G. Kutyniok, eds.), Cambridge University Press, 2012
2012
Closest in time.
A. Dembo and A. Montanari, Finite size scaling for the core of large random hypergraphs , Ann. Appl. Prob. 18
2040
Closest in time.