Design and performance of tree-structured vector quantizers

Data Compression Conference Proceedings

Volumn , Issue , 1993, Pages 292-301

  Lin, Jianhua ^a   Storer, James A ^b  

^a EASTERN CONNECTICUT STATE UNIVERSITY   (United States)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; DATA COMPRESSION; DIGITAL STORAGE;

LOSSLESS ENCODING; MULTIPLE COSTS; STORAGE COSTS; TREE-STRUCTURED; VECTOR QUANTIZERS;

VECTOR QUANTIZATION;

EID: 84892233575     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1993.253120     Document Type: Conference Paper

References (15)

1. T. Berger [1971], Rate Distortion Theory: A Mathematical Basis for Data Compression, Englewood Cliffs, NJ: Prentice-Hall.
2. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone [1984], Classification and Regression Trees, Belmont, CA: Wadsworth.
3. A. Buzo, A. H. Gray, Jr., R. M. Gray, and J. D. Markel [1980], "Speech coding based upon vector quantization," IEEE Trans. Inform. Theory, vol. IT-28, no. 5, pp. 562-574.
4. P. A. Chou, T. Lookabaugh, and R. M. Gray [1989], "Optimal pruning with applications to tree-structured source coding and modeling," IEEE Trans. Inform. Theory, vol. 35, no. 2, pp. 299-315.
5. A. Gersho [1982], "On the structure of vector quantizers," IEEE Trans. Inform. Theory, vol. 28, pp. 157-166.
6. F. S. Hill, S. Walker, and F. Gao [1983], "Interactive image query using progressive transmission," Computer Graphics, vol. 17, no. 3, pp. 323-330.
7. K. Knowlton [1980], "Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes," Proc. of the IEEE, vol. 68, no. 7, pp. 885-896.
8. J. Lin [1992], Vector Quantization for Image Compression: Algorithms and Performance, Ph.D. Dissertation, Brandeis University, MA.
9. J. Lin and J. A. Storer [1991], "Resolution-constrained tree-structured vector quantization for image compression," 1991 IEEE International Symposium on Information Theory, June, Hungary.
10. J. Lin, J. A. Storer, and M. Cohn [1992], "Optimal pruning for tree-structured vector quantization," Information Processing & Management, vol. 28, no. 6, pp. 723-733.
11. Y. Linde, A. Buzo, and R. M. Gray [1980], "An algorithm for vector quantizer design," IEEE Trans, on Communications, vol. 28, pp. 84-95.
12. J. MacQueen [1965], "On convergence of i-means and partitions with minimum average variance (abstract)," Ann. Math. Statist., vol. 36, pp. 1084.
13. J. Makhoul, S. Roucos, and H. Gish [1985], "Vector quantization in speech coding," Proc. IEEE, vol. 73, pp. 1551-1588.
14. F. P. Preparata and M. I. Shamos [1985], Computational Geometry: An Introduction, New York: Springer-Verlag.
15. E. A. Riskin and R. M. Gray [1991], "A greedy tree growing algorithm for the design of variable rate vector quantizers," IEEE Trans. Signal Proc, vol. 39, no. 11, pp. 2500-2507.