Compressive sampling and lossy compression: Do random measurements provide an efficient method of representing sparse signals?

IEEE Signal Processing Magazine

Volumn 25, Issue 2, 2008, Pages 48-56

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

^a USA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Qualcomm Technologies

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; RANDOM PROCESSES; SIGNAL PROCESSING;

COMPRESSIVE SAMPLING; LOSSY COMPRESSION; RANDOM MEASUREMENTS; SOURCE CODING; SPARSE SIGNALS; SPARSITY PATTERN;

SAMPLING;

EID: 85032750944     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2007.915001     Document Type: Article

References (30)

1. D.L. Donoho, M. Vetterli, R.A. DeVore, and I. Daubechies, "Data compression and harmonic analysis." IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2435-2476, Oct. 1998.
2. 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.
3. 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.
4. D.L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
5. B.K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2. pp. 227-234, Apr. 1995.
6. D.L. Donoho and P.B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, June 1989.
7. D.L. Donoho and J. Tanner. "Counting faces of randomly-projected polytopes when the projection radically lowers dimension," submitted for publication.
8. M.J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," Univ. California, Berkeley, Dept. ot Statistics, Tech. Report #arXiv:mAth.ST/0605740 v1 30, May 2006.
9. V.K. Goyal, "Theoretical foundations of transform coding," IEEE Signal Processing Mag., vol. 18, no. 5, pp. 9-21, Sept. 2001.
10. A.K. Fletcher, "A jump linear framework for estimation and robust communication with Markovian source and channel dynamics." Ph.D. dissertation, Dept. of Electrical Eng. Comp. Sci., Univ. California, Berkeley, Nov. 2005.
11. H. Viswanathan and R. Zamir, "On the whiteness of high-resolution quantization errors," IEEE Trans. Inform Theory, vol. 47 no. 5, pp. 2029-2038, July 2001.
12. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
13. C. Weidmann and M. Vetterli, "Rate-distortion analysis of spike processes," in Proc. IEEE Data Compression Conf., Snowbird, Utah, Mar. 1999, pp. 82-91.
14. N: Analysis, synthesis, and algorithms." IEEE Trans. Inform. Theory. vol. 44. no. 1, pp. 16-31, Jan. 1998.
15. S. Rangan and V.K. Goyal, "Recursive consistent, estimation with bounded noise," IEEE Trans. Inform. Theory, vol. 47, no. 1, pp. 457-464, Jan. 2001.
16. V.K. Goyal, J. Kovačević, and JA. Kelner, "Quantized frame expansions with erasures," Apll. Comput. Harmon. Anal., vol. 10, no. 3, pp. 203-233, May 2001.
17. A.K. Fletcher, S. Rangan, and V.K. Goyal, "On the rate-distortion performance of compressed sensing," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Honolulu, HI, vol. 3, Apr. 2007, pp. 885-888.
18. E.J. Candès and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," submitted for publication.
19. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 4036-4048, Sept. 2006.
20. N. Meinshausen and B. Yu, "Lasso-type recovery ot sparse representations for high-dimensional data," Univ. of California, Berkeley. Dept. of Statistics, Sept. 2007.
21. R.J. Pai, "Nonadaptive lossy encoding of sparse signals," M.S thesis, Dept. of Electrical Eng. Comp. Sci., MIT, Cambridge, MA, Aug. 2006.
22. A.D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory vol. IT-22, no. 1, pp. 1-10, Jan. 1976.
23. R. Zamir, "The rate loss in the Wyner-Ziv problem," IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 2073-2084, Nov 1996.
24. J. Ziv, "On universal quantization," IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 344-347, May 1985.
25. R.M. Gray and D.L. Neuhoff "Quantization," IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2325-2383, Oct. 1998.
26. R. Zamir and M. Feder, "On universal quantization by randomized uniform/lattice quantization," IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 428-436, Mar. 1992.
27. V.K. Goyal, "Multiple description coding: Compression meets the network," IEEE Signal Processing Mag., vol. 18, no. 5, pp. 74-93, Sept. 2001.
28. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
29. D. Slepian and J.K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. IT-19, no. 4, pp. 471-480, July 1973.
30. T.M. Cover and J.A. Thomas, Elements of Information Theory. New York: Wiley, 1991.