Sampling bounds for sparse support recovery in the presence of noise

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2187-2191

  Reeves, Galen ^a   Gastpar, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSIVE SENSING; FINITE RATE; INTERNATIONAL SYMPOSIUM; MODEL SELECTIONS; NECESSARY AND SUFFICIENT CONDITIONS; RANDOM PROJECTIONS; SIGNAL DE-NOISING; STOCHASTIC SIGNALS; SUFFICIENT CONDITIONS;

ACOUSTIC INTENSITY; CYBERNETICS; INFORMATION THEORY; SIGNAL PROCESSING; SIGNAL TO NOISE RATIO; STOCHASTIC PROGRAMMING; TECHNICAL PRESENTATIONS; TRAJECTORIES;

STOCHASTIC MODELS;

EID: 52349112508     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595378     Document Type: Conference Paper

References (22)

1. M. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," in Proc. Allerton Conf. on Coinm., Control, and Computing, Monticello, IL, Sep 2006.
2. _, "Information-theoretic bounds on sparsity recovery in the highdimensional and noisy setting," in Proc. IEEE Int. Symposium on Information Theory, Nice, France, Jun 2007.
3. P. Zhao and B. Yu, "On model selection consistency of Lasso," J. of Machine Learning Research, vol. 51(10), pp. 2541-2563, Nov 2006.
4. D. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52(1), pp. 6-18, Jan 2006.
5. E. Candes, J. Romberg, and T. Tao, "Stable Signal Recovery from Incomplete and Inaccurate Measurements," Comm. on Pure and Applied Math., vol. 59(8), pp. 1207-1223, 2006.
6. G. Reeves, "Sparse signal sampling using noisy linear projections," Master's thesis, EECS Department, University of California, Berkeley, Jan 2008. [Online]. Available: http://www.eecs.berkeley.edu/Pubs/ TechRpts/2008/EECS-2008-3.html
7. P. Feng and Y. Bresler, "Spectrum-blind minimum-rate sampling and reconstruction of multiband signals," in Proc. IEEE Int. Conf. Acoust. Speech Sig. Proc., vol. 3, Atlanta, GA, May 1996, pp. 1689-1692.
8. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM J. of Scientific Computing, vol. 20(1), pp. 33-61, 1998.
9. D. Donoho, "Compressed Sensing," IEEE Trans. Inf. Theory, vol. 52(4), pp. 1289-1306, Apr. 2006.
10. E. Candes, J. Romberg, and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inf. Theory, vol. 52(12), pp. 5406-5425, Dec. 2006.
11. J. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Tram. Inf. Theory, vol. 52(3), pp. 1030-1051, 2006.
12. J. Fuchs, "Recovery of exact sparse representations in the presence of noise," in Proc. IEEE Int. Conf. Acoustics. Speech and Signal Processing, Montreal, QC, Canada, May 2004, pp. 533-536.
13. _, "Recovery of exact sparse representations in the presence of bounded noise," IEEE Trans. Inf. Theory, vol. 51(10), pp. 3601-3608, Oct 2005.
14. N. Meinshausen and P. Buhlmann, "Consistent neighborhood selection for high-dimensional graphs with Lasso," Annals of Stat., vol. 34(3), 2006.
15. M. Gastpar and Y. Bresler, "On the necessary density for spectrum-blind nonuniform sampling subject to quantization," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, Istanbul, Turkey, Jun 2000, pp. 248-351.
16. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions on sparsity pattern recovery," May 2008, arXiv:0804.1839vl [cs.IT].
17. S. Sarvotham, D. Baron, and R. Baranuik, "Measurements vs. bits: Compressed sensing meets information theory," in Proc. Allerton Conf. on Comm., Control, and Computing, Monticello, IL, Sep 2006.
18. A. Fletcher, S. Rangan, and V. Goyal, "Rate-Distortion bounds for sparse approximation," in Proc. IEEE Stat. Signal Processing Workshop, Madison, WI, Aug 2007, pp. 254-258.
19. S. Aeron, M. Zhao, and V. Saligrama, "On sensing capacity of sensor networks for the class of linear observation, fixed snr models," Jun 2007, arXiv:0704.3434v3 [cs.IT].
20. M. Akcakaya and V. Tarokh, "Shannon theoretic limits on noisy compressive sampling," Nov 2007, arXiv:0711.0366vl [cs.IT].
21. V. Marcenko and L. Pastur, "Distribution of eigenvalues for some sets of random matrices," Math. USSR-Sbornik, vol. 1, pp. 457-483, 1967.
22. A. Tulino and S. Verdu, Random Matrix Theory and Wireless Communications. Hanover, MA: now Publisher Inc., 2004.