A note on optimal support recovery in compressed sensing

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2009, Pages 1576-1580

  Reeves, Galen ^a   Gastpar, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; COMPUTATIONALLY EFFICIENT; GAUSSIANS; HIGH SNR; LINEAR PROJECTIONS; LOW SNR; ML ESTIMATE; OPTIMAL ESTIMATIONS; OPTIMAL ESTIMATOR; OPTIMALITY; RECOVERY ALGORITHMS; SPARSE VECTORS; SPARSITY PATTERNS; THRESHOLDING ALGORITHMS;

ALGORITHMS; OPTIMIZATION; SIGNAL PROCESSING; SIGNAL RECONSTRUCTION;

RECOVERY;

EID: 77953817248     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2009.5470153     Document Type: Conference Paper

References (19)

1. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," in Proc. Allerton Conf. on Comm., Control, and Computing, Monticello, IL, Sep. 2006.
2. N. Meinshausen and P. Bühlmann, "High-dimensional graphs and variable selection with the lasso," Annals of Stat., vol. 34, pp. 1436-1462, 2006.
3. P. Zhao and B. Yu, "On model selection consistency of lasso," J. of Machine Learning Research, vol. 51, no. 10, pp. 2541-2563, Nov. 2006.
4. M. J. Wainwright, "Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting," in Proc. IEEE Int. Symp. on Inform. Theory, Nice, France, Jun. 2007.
5. G. Reeves, "Sparse signal sampling using noisy linear projections," Univ. of California, Berkeley, Dept. of Elec. Eng. and Cpmp. Sci., Tech. Rep. UCB/EECS-2008-3, Jan. 2008.
6. 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].
7. -, "Fundamental limits on sensing capacity for sensor networks and compressed sensing," Apr. 2008, arXiv:0804.3439v1 [cs.IT].
8. M. Akcakaya and V. Tarokh, "Shannon theoretic limits on noisy compressive sampling," Nov. 2007, arXiv:0711.0366v1 [cs.IT].
9. G. Reeves and M. Gastpar, "Sampling bounds for sparse support recovery in the presence of noise," in Proc. IEEE Int. Symp. on Inform. Theory, Toronto, Canada, Jul. 2008.
10. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions on sparsity pattern recovery," May 2008, arXiv:0804.1839v1 [cs.IT].
11. W. Wang, M. J. Wainwright, and K. Ramchandran, "Informationtheoretic limits on sparse signal recovery: Dense versus sparse measurement matrices," in Proc. IEEE Int. Symp. on Inform. Theory, Toronto, Canada, Jul. 2008.
12. D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
13. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
14. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
15. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. of Sci. Comp., vol. 20, no. 1, pp. 33-61, 1999.
16. R. Tibshirani, "Regression shrinkage and selection via the lasso,," J. Royal Stat. Soc., Ser. B, vol. 58, no. 1, pp. 267-288, 1996.
17. G. Reeves and M. Gastpar, "Approximate sparsity pattern recovery: Information-theoretic lower bounds," Preprint.
18. -, "Approximate sparsity pattern recovery: Information-theoretic upper bounds," Preprint.
19. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge University Press, 1985.