Sparse linear representation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 329-333

  Jeong, Halyun ^a   Kim, Young Han ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; GAUSSIAN SOURCES; LINEAR COMBINATIONS; LINEAR REPRESENTATION; MATCHING PURSUIT; MULTIPLE DESCRIPTIONS; OPTIMAL DISTORTION; OVERCOMPLETE DICTIONARIES; REFERENCE SIGNALS; REFINABILITY; SUCCESSIVE REFINEMENT;

INFORMATION THEORY;

SIGNAL PROCESSING;

EID: 70449482707     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205585     Document Type: Conference Paper

References (26)

1. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE Int. Conv. Rec., part 4, 1959, vol. 7, pp. 142-163, reprinted with changes in Information and decision processes, R. E. Machol, Ed. New York: McGraw-Hill, 1960, pp. 93-126.
2. S. Mallat, A Wavelet Tour of Signal Processing: The Sparse Way. London: AP Professional, 2009.
3. A. D. Wyner, "Random packings and coverings of the unit n-sphere," Bell System Tech. J., vol. 46, pp. 2111-2118, 1967.
4. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inf. Theory, vol. IT-37, no. 2, pp. 269-275, 1991.
5. E. Tuncel and K. Rose, "Additive successive refinement," IEEE Trans. Inf. Theory, vol. IT-49, no. 8, pp. 1983-1991, 2003.
6. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," in EURASIP J. Applied Signal Processing, Special Issue on Frames and Overcomplete Representations, vol. 2006, 2006.
7. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3397-3415, Dec 1993.
8. E. J. Candes and T. Tao, "Near-optimal signal recovery from random projections: universal encoding strategies?" IEEE Trans. Inf. Theory, vol. IT-52, no. 12, pp. 5406-5425, 2006.
9. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. IT-52, no. 4, pp. 1289-1306, 2006.
10. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," in Proceedings of 44th Allerton Conf. Comm., Ctrl., Computing, Monticello, IL, 2006.
11. S. Aeron, M. Zhao, and V. Saligrama, "Fundamental tradeoffs between sparsity, sensing diversity and sensing capacity," in Proceedings of the 40th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, 2006.
12. A. K. Fletcher, S. Rangan, and V. K. Goyal, "On the rate-distortion performance of compressed sensing," in Proc. ICASSP, Honolulu, HI, 2007.
13. M. Wainwright, "Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting," in Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007.
14. F. Zhang and H. D. Pfister, "Compressed sensing and linear codes over real numbers," in Proceedings of the UCSD Information Theory and Applications Workshop, La Jolla, CA, 2008.
15. W. Dai, H. V. Pham, and O. Milenkovic, "Distortion-rate functions for quantized compressive sensing," CoRR, vol. abs/0901.0749, 2009.
16. Y. Jin and B. Rao, "Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory," in Proc. ICASSP, Las Vegas, NV, 2008.
17. V. N. Temlyakov, "Nonlinear methods of approximation," Found. Comput. Math., vol. 3, no. 1, pp. 33-107, 2003.
18. E. Schmidt, "Zur Theorie der linearen und nichtlinearen Integralgleichungen," Math. Ann., vol. 63, no. 4, pp. 433-476, 1907.
19. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. IT-50, no. 10, pp. 2231-2242, 2004.
20. -, "Just relax: convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. IT-52, no. 3, pp. 1030-1051, 2006.
21. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. IT-52, no. 1, pp. 6-18, 2006.
22. M. Akcakaya and V. Tarokh, "A frame construction and a universal distortion bound for sparse representations," IEEE Trans. Signal Processing, vol. 56, no. 6, pp. 2443-2450, June 2008.
23. Y.-H. Kim, "Multiple descriptions with codebook reuse," in Proceedings of the 42th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, 2008.
24. T. M. Cover, "Some advances in broadcast channels," in Advances in Communication Systems, A. J. Viterbi, Ed. San Francisco: Academic Press, 1975, vol. 4, pp. 229-260.
25. A. D. Wyner, "Recent results in the Shannon theory," IEEE Trans. Inf. Theory, vol. IT-20, pp. 2-10, 1974.
26. Y. Jin and B. Rao, "Performance limits of matching pursuit algorithms," in Proc. IEEE International Symposium on Information Theory, Toronto, ON, July 2008.