Performance tradeoffs for exact support recovery of sparse signals

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1558-1562

  Jin, Yuzhe ^a   Kim, Young Han ^a   Rao, Bhaskar D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICS; GAUSSIAN MULTIPLE-ACCESS CHANNELS; MATHEMATICAL TOOLS; MEASUREMENT NOISE; NOISY MEASUREMENTS; NONZERO ENTRIES; PERFORMANCE TRADE-OFF; SPARSE SIGNALS; SUFFICIENT AND NECESSARY CONDITION; SUFFICIENT CONDITIONS;

ASYMPTOTIC ANALYSIS; INFORMATION THEORY;

RECOVERY;

EID: 77955685352     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513492     Document Type: Conference Paper

References (33)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
2. E. J. Candes, "Compressive sampling," Proceedings of the Int. Congress of Mathematicians, pp. 1433-1452, 2006.
3. K. Kreutz-Delgado and B. D. Rao, "Measures and algorithms for best basis selection," Proc. ICASSP, vol. 3, pp. 1881-1884, 1998.
4. Y. Jin and B. D. Rao, "Algorithms for robust linear regression by exploiting the connection to sparse signal recovery," ICASSP, 2010.
5. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Sig. Proc, vol. 41, no. 12, pp. 3397-3415, 1993.
6. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," 27th Annual Asilomar Conf. Sig. Sys. Comp., 1993.
7. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIREV, vol. 43, no. 1, pp. 129-159, 2001.
8. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Statist. Soc. B, vol. 58, no. 1, pp. 267-288, 1996.
9. I. Gorodnitsky and B. Rao, "Sparse signal reconstruction from limited data using focuss: A re-weighted norm minimization algorithm," IEEE Trans. Sig. Proc, vol. 45, no. 3, pp. 600-616, 1997.
10. D. Wipf and B. D. Rao, "Sparse bayesian learning for basis selection," IEEE Trans. Sig. Proc, vol. 52, no. 8, pp. 2153-2164, August 2004.
11. S. Baillet, J. C. Mosher, and R. M. Leahy, "Electromagnetic brain mapping," IEEE Signal Process. Mag., pp. 14-30, 2001.
12. Z. Tian and G. B. Giannakis, "Compressed sensing for wideband cognitive radios," ICASSP, pp. 1357-1360, 2007.
13. 1-norm solution is also the sparsest solution," Comm. Pure Appl. Math, vol. 59, pp. 797-829, 2004.
14. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inform. Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
15. J. A. Tropp, "Greedy is good: Algorithmic results for sparse approximation," IEEE Trans. Info. Theo., vol. 50, no. 10, pp. 2231-2242, 2004.
16. D. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presense of noise," IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 6-18, 2006.
17. 1-constrained quadratic programming (lasso)," IEEE Trans. Info. Theory, vol. 55, no. 5, pp. 2183-2202, 2009.
18. -, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Info. Theo., Dec 2009.
19. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions for sparsity pattern recovery," IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5758-5772, Dec 2009.
20. W. Wang, M. J. Wainwright, and K. Ramchandran, "Information- theoretic limits on sparse signal recovery: Dense versus sparse measurement," Proc. of ISIT, pp. 2197-2201, 2008.
21. M. Akcakaya and V. Tarokh, "Shannon theoretic limits on noisy compressive sampling," IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 492-504, 2010.
22. Y. Jin and B. D. Rao, "Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory," ICASSP, 2008.
23. -, "Performance limits of matching pursuit algorithms," ISIT, 2008.
24. T. Cover and J. Thomas, Elements of Information Theory. Wiley, 2006.
25. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," Proceedings of 44th Allerton Conf. Comm., Ctrl, Computing, 2006.
26. J. Tropp, "Just relax: Convex programming methods for identifying sparse signal in noise," IEEE Trans. Info. Theo., vol. 52, no. 3, 2006.
27. A. K. Fletcher, S. Rangan, and V. K. Goyal, "On-off random access channels: A compressed sensing framework," submitted to IEEE Trans. Information Theory.
28. D. Donoho, Y Tsaig, I. Drori, and J. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," preprint, 2006.
29. B. Hassibi and B. Hochwald, "How much training is needed in multiple-antenna wireless links?" IEEE Trans. Info. Theory, vol. 49, no. 4, 2003.
30. A. Lapidoth, "Nearest neighbor decoding for additive non-gaussian noise channels," IEEE Trans. Info. Theory, vol. 42, pp. 1520-1529, 1996.
31. S. I. Resnick, A probability path. Birkhauser Boston, 1999.
32. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press, 2005.
33. S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Sig. Proc, vol. 53, no. 7, pp. 2477-2488, 2005.