Fetching the paper…
Reading the bibliography…
Compressed sensing deals with efficient recovery of analog signals from linear encodings.
H. Steinhaus, “Sur les distances des points des ensembles de mesure positive,” Fundamenta Mathematicae , vol. 1, pp. 93 – 104, 1920
1920
Earlier work this paper cites.
1943
Earlier work this paper cites.
C. E. Shannon, “Communication in the presence of noise,” in Proceedings of the IRE , vol. 37, no. 1, Jan. 1949, pp. 10–21
1949
Earlier work this paper cites.
A. Rényi, “On the dimension and entropy of probability distributions,” Acta Mathematica Hungarica , vol. 10, no. 1 – 2, Mar. 1959
1959
Earlier work this paper cites.
T. Goblick Jr., “Theoretical limitations on the transmission of data from analog sources,” IEEE Transactions on Information Theory , vol. 11, no. 4, pp. 558–567, 1965
1965
Earlier work this paper cites.
H. Federer, Geometric Measure Theory . New York, NY: Springer-Verlag, 1969
1969
Earlier work this paper cites.
J. T. Schwartz, Nonlinear Functional Analysis . New York, NY: Gordon and Breach Science Publishers, 1969
1969
Earlier work this paper cites.
A. Rényi, Probability Theory . Amsterdam: North-Holland Publishing Company, 1970
1970
Earlier work this paper cites.
J. Ziv, “The behavior of analog communication systems,” IEEE Transactions on Information Theory , vol. 16, no. 5, pp. 587–594, 1970
1970
Earlier work this paper cites.
T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression . Englewood Cliffs, NJ: Prentice-Hall, 1971
1971
Earlier work this paper cites.
H. E. Stanley, Introduction to phase transitions and critical phenomena . London, United Kingdom: Oxford University Press, 1971
1971
Earlier work this paper cites.
K. H. Lee and D. P. Petersen, “Optimal linear coding for vector channels,” IEEE Transactions on Communications , vol. 24, no. 12, pp. 1283–1290, Dec. 1976
1976
Earlier work this paper cites.
U. Brehm, “Extensions of distance reducing mappings to piecewise congruent mappings on 𝐑 m \mathbf{R}^{m} ,” Journal of Geometry , vol. 16, no. 1, pp. 187–193, 1981
1981
Earlier work this paper cites.
A. Edelman, “Eigenvalues and condition numbers of random matrices,” SIAM Journal on Matrix Analysis and Applications , vol. 9, no. 4, pp. 543–560, Oct. 1988
1988
Earlier work this paper cites.
S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing , vol. 41, no. 12, pp. 3397–3415, 1993
1993
Earlier work this paper cites.
T. Kawabata and A. Dembo, “The rate-distortion dimension of sets and measures,” IEEE Transactions on Information Theory , vol. 40, no. 5, pp. 1564 – 1572, Sep. 1994
1994
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the LASSO,” vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
P. Feng and Y. Bresler, “Spectrum-blind minimum-rate sampling and reconstruction of multiband signals,” in IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 3, 1996, pp. 1688–1691
1996
Earlier work this paper cites.
B. R. Hunt and V. Y. Kaloshin, “How projections affect the dimension spectrum of fractal measures,” Nonlinearity , vol. 10, pp. 1031–1046, 1997
1997
Earlier work this paper cites.
Y. B. Pesin, Dimension Theory in Dynamical Systems: Contemporary Views and Applications . Chicago, IL: University of Chicago Press, 1997
1997
Earlier work this paper cites.
R. Zamir, “A proof of the Fisher information inequality via a data processing argument,” IEEE Transactions on Information Theory , vol. 44, no. 3, pp. 1246–1250, May 1998
1998
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Journal on Scientific Computing , vol. 20, no. 1, pp. 33–61, 1999
1999
Earlier work this paper cites.
B. R. Hunt and V. Y. Kaloshin, “Regularity of embeddings of infinite-dimensional fractal sets into finite-dimensional spaces,” Nonlinearity , vol. 12, no. 5, pp. 1263–1275, 1999
1999
Earlier work this paper cites.
P. Mattila, Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability . Cambridge, United Kingdom: Cambridge University Press, 1999
1999
Earlier work this paper cites.
A. György, T. Linder, and K. Zeger, “On the rate-distortion function of random vectors and stationary sources with mixed distributions,” IEEE Transactions on Information Theory , vol. 45, pp. 2110 – 2115, Sep. 1999
1999
Earlier work this paper cites.
Y. Peres and B. Solomyak, “Existence of L q L_{q} dimensions and entropy dimension for self-conformal measures,” Indiana University Mathematics Journal , vol. 49, no. 4, pp. 1603–1621, 2000
2000
Cited alongside, same era.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors,” IEEE Transactions on Information Theory , vol. 48, pp. 2888–2910, Nov. 2002
2002
Cited alongside, same era.
K. Falconer, Fractal Geometry: Mathematical Foundations and Applications , 2nd ed. New York: Wiley, 2003
2003
Cited alongside, same era.
M. Gastpar, B. Rimoldi, and M. Vetterli, “To code, or not to code: Lossy source-channel communication revisited,” IEEE Transactions on Information Theory , vol. 49, no. 5, pp. 1147–1158, 2003
2003
Cited alongside, same era.
S. P. Boyd and L. Vandenberghe, Convex Optimization . Cambridge, United Kingdom: Cambridge University Press, 2004
Y. Wu, “MMSE dimension and noisy compressed sensing,” poster in Third Annual School of Information Theory , University of Southern California, Los Angeles CA, Aug. 2010
2010
Later among the works it cites.
Y. Wu and S. Verdú, “Rényi information dimension: Fundamental limits of almost lossless analog compression,” IEEE Transactions on Information Theory , vol. 56, no. 8, pp. 3721 – 3748, Aug. 2010
2010
Later among the works it cites.
Y. Kabashima, T. Wadayama, and T. Tanaka, “Statistical mechanical analysis of a typical reconstruction limit of compressed sensing,” in Proceedings of 2010 IEEE International Symposium on Information Theory , Austin, TX, Jun. 2010
2010
Later among the works it cites.
M. Akçakaya and V. Tarokh, “Shannon-theoretic limits on noisy compressive sampling,” IEEE Transactions on Information Theory , vol. 56, no. 1, pp. 492–504, Jan. 2010
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…
2004
Cited alongside, same era.
2004
Cited alongside, same era.
D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,” IEEE Transactions on Information Theory , vol. 51, no. 6, pp. 1983–2010, Jun. 2005
2005
Cited alongside, same era.
D. Guo, S. Shamai (Shitz), and S. Verdú, “Mutual Information and Minimum Mean-Square Error in Gaussian Channels,” IEEE Transactions on Information Theory , vol. 51, no. 4, pp. 1261 – 1283, Apr. 2005
2005
Cited alongside, same era.
E. Candés, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 489 – 509, Feb. 2006
2006
Cited alongside, same era.
D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289 – 1306, Apr. 2006
2006
Cited alongside, same era.
E. Candés and T. Tao, “Near optimal signal recovery from random projections: Universal encoding strategies?” IEEE Transactions on Information Theory , vol. 52, no. 12, pp. 5406 – 5425, Dec. 2006
2006
Cited alongside, same era.
A. Guionnet and D. Shlyakhtenko, “On classical analogues of free entropy dimension,” Journal of Functional Analysis , vol. 251, no. 2, pp. 738 – 771, Oct. 2007
2007
Cited alongside, same era.
D. L. Donoho and J. Tanner, “Counting the faces of randomly-projected hypercubes and orthants, with applications,” Discrete and Computational Geometry , vol. 43, no. 3, pp. 522–541, 2010
2010
Later among the works it cites.
D. L. Donoho and J. Tanner, “Precise undersampling theorems,” Proceedings of the IEEE , vol. 98, no. 6, pp. 913–924, 2010
2010
Later among the works it cites.
K. Do Ba, P. Indyk, E. Price, and D. P. Woodruff, “Lower bounds for sparse recovery,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms , 2010, pp. 1190–1197
2010
Later among the works it cites.
J. D. Blanchard, C. Cartis, J. Tanner, and A. Thompson, “Phase transitions for greedy sparse approximation algorithms,” Applied and Computational Harmonic Analysis , pp. 188 – 203, 2010
2010
Later among the works it cites.
S. Kudekar and H. D. Pfister, “The effect of spatial coupling on compressive sensing,” in Proceedings of the Forty-eighth Annual Allerton Conference on Communication, Control, and Computing , 2010, pp. 347–353
2010
Later among the works it cites.
D. L. Donoho, A. Maleki, and A. Montanari, “The noise-sensitivity phase transition in compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 10, pp. 6920–6941, Oct. 2011
2011
Closest in time.
——, “The sampling rate-distortion tradeoff for sparsity pattern recovery in compressed sensing,” IEEE Transactions on Information Theory , vol. 58, no. 5, pp. 3065 – 3092, May 2011
2011
Closest in time.
2011
Closest in time.
A. M. Tulino, G. Caire, S. Shamai (Shitz), and S. Verdú, “Support recovery with sparsely sampled free random matrices,” in Proceedings of 2011 IEEE International Symposium on Information Theory , Saint Petersburg, Russia, Aug. 2011
2011
Closest in time.
Y. Wu and S. Verdú, “MMSE dimension,” IEEE Transactions on Information Theory , vol. 57, no. 8, pp. 4857 – 4879, Aug. 2011
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 764–785, 2011
2011
Closest in time.
D. Guo, Y. Wu, S. Shamai (Shitz), and S. Verdú, “Estimation in Gaussian Noise: Properties of the Minimum Mean-square Error,” IEEE Transactions on Information Theory , vol. 57, no. 4, pp. 2371 – 2385, Apr. 2011
2011
Closest in time.
2011
Closest in time.
D. L. Donoho, A. Maleki, and A. Montanari, “How to design message passing algorithms for compressed sensing,” preprint, 2011. [Online]. Available: http://www.ece.rice.edu/~mam15/bpist.pdf
2011
Closest in time.
Y. Wu and S. Verdú, “Optimal phase transitions in compressed sensing with noisy measurements,” submitted to 2012 IEEE International Symposium on Information Theory
2012
Closest in time.
Y. Wu and S. Verdú, “Functional properties of MMSE and mutual information,” IEEE Transactions on Information Theory , vol. 58, no. 3, pp. 1289 – 1301, Mar. 2012
2012
Closest in time.
S. Rangan, A. K. Fletcher, and V. K. Goyal, “Asymptotic analysis of map estimation via the replica method and applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 58, no. 3, pp. 1902–1923, Mar. 2012
2012
Closest in time.
M. Bayati and A. Montanari, “The LASSO risk for Gaussian matrices,” IEEE Transactions on Information Theory , vol. 58, no. 4, pp. 1997–2017, Apr. 2012
2012
Closest in time.
A. Montanari, “Graphical models concepts in compressed sensing,” in Compressed Sensing: Theory and Applications . Cambridge Press, 2012, pp. 394–438
2012
Closest in time.