Rate-distortion bounds for sparse approximation

IEEE Workshop on Statistical Signal Processing Proceedings

Volumn , Issue , 2007, Pages 254-258

  Fletcher, Alyson K ^a   Rangan, Sundeep ^b   Goyal, Vivek K ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b QUALCOMM INC   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Basis pursuit; Compressed sensing; Estimation; Matching pursuit; Maximum likelihood; Unions of subspaces

Indexed keywords

ACOUSTIC INTENSITY; ASYMPTOTIC ANALYSIS; BLIND SOURCE SEPARATION; BLOCK CODES; IMAGE PROCESSING; MAXIMUM LIKELIHOOD; POLYNOMIAL APPROXIMATION; SIGNAL PROCESSING; SIGNAL RECONSTRUCTION; SIGNAL TO NOISE RATIO; TECHNICAL PRESENTATIONS;

BASIS PURSUIT; COMPRESSED SENSING; GAUSSIAN NOISES; MATCHING PURSUIT; MAXIMUM LIKELIHOOD ESTIMATES; RATE DISTORTIONS; RELIABLE DETECTIONS; SIGNAL-TO-NOISE RATIOS; SPARSE APPROXIMATIONS; SPARSE SIGNALS; SQUARED ERRORS; UNIONS OF SUBSPACES;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 47849101498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSP.2007.4301258     Document Type: Conference Paper

References (17)

1. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Computing, vol. 24, no. 2, pp. 227-234, Apr. 1995.
2. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Proc., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
3. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001.
4. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inform. Theory, vol. 48, no. 9, pp. 2558-2567, Sept. 2002.
5. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
6. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inform. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
7. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1341-1344, June 2004.
8. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
9. D. L. Donoho and M. Elad, "On the stability of basis pursuit in the presence of noise," Signal Proc., vol. 86, no. 3, pp. 511-532, Mar. 2006.
10. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
11. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," Tech. Rep., Univ. of California, Berkeley, Dept. of Statistics, May 2006, arXiv:math.ST/0605740 v1 30 May 2006.
12. 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.
13. D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 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. A. K. Fletcher, S. Rangan, V. K Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Sig. Proc., vol. 2006, pp. 1-19, Mar. 2006.
16. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," in Proc. 44th Ann. Allerton Conf. on Commun., Control and Comp., Monticello, IL, Sept. 2006.
17. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, New York, 1991.