Shannon-theoretic limits on noisy compressive sampling

IEEE Transactions on Information Theory

Volumn 56, Issue 1, 2010, Pages 492-504

  Akçakaya, Mehmet ^a   Tarokh, Vahid ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Compressed sensing; Compressive sampling; Estimation error; Fano's inequality; Joint typicality; Linear regime; Shannon theory; Sublinear regime; Support recovery

Indexed keywords

COMPRESSED SENSING; COMPRESSIVE SAMPLING; JOINT TYPICALITY; LINEAR REGIME; SHANNON THEORY; SUBLINEAR;

CHANNEL CODING; INFORMATION THEORY; RANDOM PROCESSES; RANDOM VARIABLES; SIGNAL RECONSTRUCTION; TRELLIS CODES;

RECOVERY;

EID: 73849138881     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2034796     Document Type: Article

References (26)

1. M. Akçakaya and V. Tarokh, "A frame construction and a universal distortion bound for sparse representations," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2443-2450, Jun. 2008.
2. B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asymptotic achievability of the Cramer-Rao bound for noisy compressive sampling," IEEE Trans. signal Process., vol. 57, no. 3, pp. 1233-1236, Mar. 2009.
3. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
4. L. Birgé and P. Massart, "Minimum contrast estimators on sieves: Exponential bounds and rates of convergence," Bernoulli, vol. 4, no. 3, pp. 329-375, Sep. 1998.
5. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
6. E. J. Candès and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," Ann. Statist., vol. 35, pp. 2313-2351, Dec. 2007.
7. E. J. Candès and J. Romberg, "Practical signal recovery from random projections," in Proc. XI Conf. Wavelet Applications and Signal Image Processing, San Diego, CA, 2005.
8. E. J. Candès, J. Romberg, and T. Tao, "Stable signal recovery for incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, pp. 1207-1223, Aug. 2006.
9. S. S. Chen, D. L. Donoho, and M. A. Saunder, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, Jul. 2003.
10. T. M. Cover and J. M. Thomas, Elements of Information Theory, 2nd ed. New York: Wiley, 2006.
11. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230-2249, May 2009.
12. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
13. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions on sparsity pattern recovery," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5758-5772, Dec. 2009, , Apr. 2008.
14. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchadran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Signal Process., vol. 2006, pp. 1-19, Article ID 26318.
15. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
16. B. Laurent and P. Massart, "Adaptive estimation of a quadratic functional by model selection," Ann. Statist., vol. 28, no. 5, pp. 1303-1338, Oct. 2000.
17. D. Needell and J. A. Tropp, "Cosamp: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, pp. 301-321.
18. D. Omidiran and M. J. Wainwright, "High-Dimensional Subset Recovery in Noise: Sparsified Measurements Without Loss of Statistical Efficiency," Dept. Statist., UC Berkeley, Berkeley, CA, Tech. Rep., 2008.
19. G. Reeves and M. Gastpar, "Sampling bounds for sparse support recovery in the presence of noise," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 2187-2191.
20. S. Sarvotham, D. Baron, and R. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2006.
21. J. A. Tropp, "Topics in Sparse Approximation," Ph.D. dissertation, Computational and Applied Mathematics, UT-Austin, TX, 2004.
22. J. A. Tropp, "Just relax: convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
23. B. Vucetic and J. Yuan, Space-Time Coding. New York:Wiley, 2003.
24. M. J.Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5728-5741, Dec. 2009.
25. 1-constrained quadratic programming," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2183-2202, May 2009, "," Dept. Statistics, UC Berkeley, Berkeley, CA, Tech, Rep., 2006.
26. W. Wang, M. J.Wainwright, and K. Ramchandran, "Information-Theoretic Limits on Sparse Signal Recovery: Dense Versus Sparse Measurement Matrices," Dept. Statistics, UC Berkeley, Berkeley, CA, Tech. Rep., 2008.