Algorithms for fast vector quantization

Data Compression Conference Proceedings

Volumn , Issue , 1993, Pages 381-390

  Arya, Sunil ^a   Mount, David M ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DIRECTED GRAPHS; LEARNING ALGORITHMS; NEAREST NEIGHBOR SEARCH; VECTOR QUANTIZATION;

K-D TREE; NEAREST NEIGHBORS; NEAREST-NEIGHBOR SEARCHING; NEIGHBORHOOD GRAPHS; NEIGHBORING POINT; POINT SET; RUNNING TIME; VECTOR QUANTIZERS;

TREES (MATHEMATICS);

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

References (12)

1. S. Arya and D. M. Mount. Algorithms for fast vector quantization. Technical Report CS-TR-3017, University of Maryland Institute for Advanced Computer Studies (UMIACS), January 1993.
2. S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, 1993.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, September 1975.
4. J. L. Bentley. K-d trees for semidynamic point sets. In Proc. 6th Ann. ACM Sympos. Comput. Geom., pages 187-197, 1990.
5. D. Y. Cheng and A. Gersho. A fast codebook search algorithm for nearest-neighbor pattern matching. In Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, volume 1, pages 265-268, April 1986.
6. W. H. Equitz. A new vector quantization clustering algorithm. IEEE Transactions on Acoust., Speech and Signal Process., 37(10):1568-1575, October 1989.
7. J. H. Friedman, J. L. Bentley, and R.A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, September 1977.
8. K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers, 24:750-753, July 1975.
9. A. Gersho and R. M. Gray. Vector Quantization and Signal Compression. Kluwer Academic, 1991.
10. J. W. Jaromczyk and M. Kowaluk. A note on relative neighborhood graphs. In Proc. 3rd Ann. ACM Sympos. Comput. Geom., pages 233-241, 1987.
11. R. L. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6, 1991.
12. G. T. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980.