Multiresolution vector quantization

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 3130-3145

  Effros, Michelle ^a   Dugatkin, Diego ^a,b  

^a California Institute of Technology   (United States)

^b Ixia   (United States)

Author keywords

Embedded source code design; Fixed rate; Multiuser; Network; Progressive transmission; Successive refinement; Variable rate

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); VECTOR QUANTIZATION;

EMBEDDED SOURCE CODE DESIGN; FIXED RATE; PROGRESSIVE TRANSMISSION; SUCCESSIVE REFINEMENT; VARIABLE RATE;

DATA COMPRESSION;

EID: 10644252848     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.838381     Document Type: Article

References (44)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
2. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
3. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
4. M. Effros, P. A. Chou, and R. M. Gray, "Variable-rate source coding theorems for stationary nonergodic sources," IEEE Trans. Inform. Theory, vol. 40, pp. 1920-1925, Nov. 1994.
5. Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. 28, pp. 84-95, Jan. 1980.
6. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Entropy-constrained vector quantization," IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 31-42, Jan. 1989.
7. W. H. R. Equitz, "Successive refinement of information," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1989.
8. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, Mar. 1991.
9. J. Chow and T. Berger, "Failure of successive refinement for symmetrical Gaussian mixtures," IEEE Trans. Inform. Theory, vol. 43, pp. 350-352, Jan. 1997.
10. L. Lastras and T. Berger, "All sources are nearly successively refinable," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 127.
11. L. Lastras and T. Berger, "All sources are nearly successively refinable," IEEE Trans. Inform. Theory, vol. 47, pp. 918-926, Mar. 2001.
12. H. Feng and M. Effros, "Improved bounds for the rate loss of multiresolution source codes," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 193.
13. H. Feng and M. Effros, "Improved bounds for the rate loss of multi-resolution source codes," IEEE Trans. Inform. Theory, vol. 49, pp. 809-821, Apr. 2003.
14. R. M. Gray and A. D. Wyner, "Source coding for a simple network," Bell Syst. Tech. J., vol. 53, no. 9, pp. 1681-1721, Nov. 1974.
15. I. Csiszar and J. Köner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic; 1981.
16. B. Rimoldi, "Successive refinement of information: Characterization of achievable rates," IEEE Trans. Inform. Theory, vol. 40, pp. 253-259, Jan. 1994.
17. M. Effros, "Multi-resolution source coding theorems," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 226.
18. M. Effros, "Distortion-rate bounds for fixed- and variable-rate multiresolution source codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1887-1910, Sept. 1999.
19. M. Effros, "Practical multi-resolution source coding: TSVQ revisited," in Proc. Data Compression Conf., Snowbird, UT, Mar. 1998, pp. 53-62.
20. D. Dugatkin and M. Effros, "Setting priorities: A new SPIHT-compatible algorithm for image compression," in Proc. SPIE Int. Symp. Optical Science and Technology, vol. 4119, San Diego, CA, July 2000, pp. 799-805.
21. D. Dugatkin, H. Zhou, T. Chan, and M. Effros, "Lagrangian optimization of the group testing for wavelets algorithm," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2002.
22. R. M. Gray, Probability, Random Processes, and Ergodic Properties. New York: Springer-Verlag, 1988.
23. A. Buzo, A. H. Gray Jr, R. M. Gray, and J. D. Markel, "Speech coding based upon vector quantization," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 562-574, Oct. 1980.
24. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Optimal pruning with applications to tree structured source coding and modeling," IEEE Trans. Inform. Theory, vol. 35, pp. 299-315, Mar. 1989.
25. E. A. Riskin and R. M. Gray, "A greedy tree growing algorithm for the design of variable rate vector quantizers," IEEE Trans. Signal Processing, vol. 39, pp. 2500-2507, Nov. 1991.
26. B.-H. Juang and J. A. H. Gray, "Multiple stage vector quantization for speech coding," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. 1, Paris, France, 1982, pp. 597-600.
27. C. F. Barnes, S. A. Rizvi, and N. M. Nasrabadi, "Advances in residual vector quantization: A review," IEEE Trans. Image Processing, vol. 5, pp. 226-262, Feb. 1996.
28. A. N. Netravali and B. G. Haskell, Digital Pictures: Representation, Compression, and Standards, 2nd ed. New York/London: Plenum, 1995.
29. H. Brunk and N. Farvardin, "Embedded entropy-constrained trellis coded quantization," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 274.
30. J. M. Shapiro, "Embedded image coding using zerotrees of wavelet coefficients," IEEE Trans. Signal Processing, vol. 41, pp. 3445-3462, Dec. 1993.
31. A. Said and W. A. Pearlman, "A new, fast, and efficient image codec based on set partitioning in hierarchical trees," IEEE Trans. Circuits and Systems for Video Technol., vol. 6, pp. 243-250, June 1996.
32. E. Ordentlich, M. Weinberger, and G. Seroussi, "A low-complexity modeling approach for embedded coding of wavelet coefficients," in Proc. Data Compression Conf., Snowbird, UT, Mar. 1998, pp. 408-417.
33. E. A. Riskin, R. Ladner, R. Wang, and L. E. Atlas, "Index assignment for progressive transmission of full-search vector quantization," IEEE Trans. Image Processing, vol. 3, pp. 307-312, May 1994.
34. S. Herman and K. Zeger, "Variable fanout trimmed tree-structured vector quantization for multirate channels," in Proc. IEEE Int. Symp. Information Theory and Its Applic., vol. 1, Victoria, BC, Canada, Sept. 1996, pp. 417-421.
35. H. Brunk and N. Farvardin, "Fixed-rate successively refinable scalar quantizers," in Proc. Data Compression Conf., Snowbird, UT, Apr. 1996, pp. 250-259.
36. H. Brunk, H. Jafarkhani, and N. Farvardin, "Design of successively refinable scalar quantizers," preprint, Apr. 1998.
37. H. Jafarkhani, H. Brunk, and N. Farvardin, "Entropy-constrained successively refinable scalar quantization," in Proc. Data Compression Conf., Snowbird, UT, Mar. 1997, pp. 337-346.
38. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Norwell, MA: Kluwer, 1992.
39. P. C. Chang, J. May, and R. M. Gray, "Hierarchical vector quantizers with table-lookup encoders," Proc. Int. Conf. Communications, vol. 3, pp. 1452-1455, June 1985.
40. M. Vishwanath and P. Chou, "An efficient algorithm for hierarchical compression of video," in Proc. IEEE Int. Conf. Image Processing, vol. 3, Austin, TX, Nov. 1994, pp. 275-279.
41. N. Chaddha, P. A. Chou, and R. M. Gray, "Constrained and recursive hierarchical table lookup vector quantization," in Proc. Data Compression Conf., Snowbird, UT, Mar. 1996, pp. 220-229.
42. T. D. Lookabaugh and R. M. Gray, "High resolution quantization theory and the vector quantization advantage," IEEE Trans. Inform. Theory vol. 35, pp. 1020-1033, Sept. 1989.
43. S. P. Lloyd, "Least squares quantization in PCM," IEEE Trans. Inform. Theory, vol. IT-28, pp. 129-136, Mar. 1982.
44. M. Effros and D. Muresan, "Codecell contiguity in optimal scalar quantizers," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2002, pp. 312-321.