Improved Techniques for Single-Pass Adaptive Vector Quantization

Proceedings of the IEEE

Volumn 82, Issue 6, 1994, Pages 933-939

  Constantinescu, Cornel ^a   Storer, James A ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; DATA STRUCTURES; IMAGE QUALITY; TREES (MATHEMATICS); VECTORS;

CODEBOOK ENTRIES; K-D TREES; SINGLE PASS ADAPTIVE VECTOR QUANTIZATION; VISUAL QUALITY;

IMAGE COMPRESSION;

EID: 0028449880     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.286197     Document Type: Article

References (14)

1. J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Commun. ACM, vol. 18, pp. 509–517, 1975.
2. J. L. Bentley and J. H. Friedman, “Data structures for range searching,” ACM Comput. Surv., vol. 11, no. 4, pp. 397–409, 1979.
3. J. L. Bentley and D. F. Stanat, “Analysis of range searching in quad trees,” Informat. Process. Lett., vol. 3, no. 6, pp. 170–173, 1975.
4. C. Constantinescu and J. A. Storer, “Online adaptive vector quantization with variable size codebook entries,” in Proc. IEEE Data Compression Conf. (Snowbird, UT, 1993). IEEE Computer Soc. Press, pp. 32–41.
5. “Online adaptive vector quantization with variable size codebook entries,” J. Informat. Process. Manag., to appear, 1994.
6. B. V. Dasarathy, Ed., Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Soc. Press, 1991.
7. J. H. Friedman, J. L. Bentley, and R. A. Finkel, “An algorithm for finding best matches in logarithmic expected time,” ACM Trans. Math. Softw., vol. 3, no. 3, pp. 209–226, 1977.
8. R. M. Gray, P. C. Cosman, and E. A. Riskin, “Combining vector quantization and histogram equalization,” in Proc. IEEE Data Compression Conf. (Snowbird, UT, 1991). IEEE Computer Soc. Press, pp. 113–118.
9. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Norwell, MA: Kluwer, 1991.
10. J. Lin, “Vector quantization for image compression: Algorithms and performance” Ph.D. dissertation, Computer Science Dep., Brandeis University, Waltham, MA, 1992.
11. C. N. Manikopoulos and H. Sun, “Activity index threshold classification in adaptive vector quantization,” in Conf. Proc. 1988 Int. Conf. on Acoustics, Speech, and Signal Processing (IEEE), pp. 1235–1239, 1988.
12. M. H. Overmars and J. van Leeuven, “Dynamic multidimensional data structures based on quad-and K-D trees,” Acta lnformatica, vol. 17, 267–285, 1982.
13. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
14. J. A. Storer, Data Compression: Methods and Theory. Rockville, MD: Computer Sci. Press, 1988.