Voronoi Projection-Based Fast Nearest-Neighbor Search Algorithms: Box-Search and Mapping Table-Based Search Techniques

Digital Signal Processing: A Review Journal

Volumn 7, Issue 4, 1997, Pages 260-277

  Ramasubramanian, V ^a   Paliwal, K K ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION THEORY; DATA COMPRESSION; VECTOR QUANTIZATION;

VORONOI DIAGRAMS;

SIGNAL ENCODING;

EID: 0031248531     PISSN: 10512004     EISSN: None     Source Type: Journal    
DOI: 10.1006/dspr.1997.0300     Document Type: Article

References (50)

1. Abut, H. Vector Quantization. IEEE, Piscataway, NJ, 1990.
2. Avis, D., and Bhattacharya, B. K. Algorithms for computing d-dimensional Voronoi diagrams and their duals. In Advances in Computing Research, Vol. I, pp. 159-180. JAI Press, London, 1983.
3. Barlaud, M., et al. IEEE Trans. Image Process. 5(2) (1996). [Special issue on vector quantization]
4. Bei, C. D., and Gray, R. M. An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Commun. COM-33 (1985), 1132-1133.
5. Bowyer, A. Computing dirichlet tesselations. Comput. J. 24(2) (1981), 162-172.
6. Brown, K. Q. Geometric Transformations for Fast Geometric Algorithms. Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Dec. 1979.
7. Browstow, W., Dussault, J.-P., and Fox, B. L. Construction of Voronoi polyhedra. J. Comput. Phys. 29 (1978), 81-92.
8. Burkhard, W. A., and Keller, R. M. Some approaches to best-match file searching. Commun. ACM 16(4) (1973), 230-236.
9. Chen, S. H., and Pan, J. S. Fast search algorithm for VQ-based recognition of isolated words, IEE Proc. 136(6) (1989), 391-396.
10. Cheng, D. Y., Gersho, A., Ramamurthi, B., and Shoham, Y. Fast search algorithms for vector quantization and pattern matching. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar. 1984, Vol. 1, pp. 9.11.1-9.11.4.
11. Clarkson, K. L. A probabilistic algorithm for the post office problem. In Proc. 17th Ann. ACM Symp. Theory Comput., 1985, pp. 175-184.
12. Clarkson, K. L. A randomized algorithm for closest-point queries. SIAM J. Comput. 17(4) (1988), 830-847.
13. Dobkin, D. P., and Lipton, R. J. Multidimensional searching problems. SIAM J. Comput. 5(2) (1976), 181-186.
14. Duda, R. O., and Hart, P. E. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
15. Edelsbruner, H. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin/New York, 1987.
16. Fischer, F. P., and Patrick, E. A. A preprocessing algorithm for nearest neighbour decision rules. In Proc. Nat. Electronics Conf., 1970, Vol. 26, pp. 481-485.
17. Fukanaga, K., and Narendra, P. M. A branch and bound algorithm for computing k-nearest neighbours. IEEE Trans. Comput. 24 (1975), 750-753.
18. Gersho, A., and Cuperman, V. Vector quantization: A pattern matching technique for speech coding. IEEE Commun. Mag. 21 (1983), 15-21.
19. Gersho, A., and Gray, R. M. Vector Quantization and Signal Compression. Kluwer, Boston, 1992.
20. Gray, R. M. Vector quantization. IEEE ASSP Mag. 1 (1984), 4-29.
21. Huang, S. H., and Chen, S. H. Fast encoding algorithm for VQ-based image coding. Electron. Lett. 26(19) (1990), 1618-1619.
22. Kalantari, I., and McDonald, G. A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Eng. SE-9(5) (1983), 631-634.
23. Kamgar-Parsi, B., and Kanal, L. N. An improved branch and bound algorithm for computing k-nearest neighbours. Pattern Recognition Lett. 3 (1985), 7-12.
24. Klee, V. On the complexity of d-dimensional Voronoi diagrams. Arch. Math. 34 (1980), 75-80.
25. Kleijn, W. B., and Paliwal, K. K. Speech Coding and Synthesis. Elsevier, Amsterdam, 1995.
26. Lee, D. T., and Preparata, F. P. Computational geometry - A survey. IEEE Trans. Comput. C-33(12) (1984), 1072-1101.
27. Linde, Y., Buzo, A., and Gray, R. M. An algorithm for vector quantization design. IEEE Trans. Commun. COM-28 (1980), 84-95.
28. Makhoul, J., Roucos, S., and Gish, H. Vector quantization in speech coding. Proc. IEEE 73 (1985), 1555-1588.
29. Niemann, H., and Goppert, R. An efficient branch-and-bound nearest-neighbour classifier. Pattern Recognition Lett. 7 (1988), 67-72.
30. Orchard, M. T. A fast nearest-neighbor search algorithm. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, Toronto, Canada, May 1991, pp. 2297-2300.
31. Paliwal, K. K., and Ramasubramanian, V. Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization. IEEE Trans. Commun. COM-37 (1989), 538-540.
32. Preparata, F. P., and Shamos, M. I. Computational Geometry. Springer-Verlag, Berlin/New York, 1985.
33. Ramasubramanian, V., and Paliwal, K. K. An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation. In Signal Processing V: Theories and Applications, Proc. of the EUSIPCO '90, Barcelona, Spain (L. Torres-Urgell and M. A. Lagunas-Hernandez, Eds.), pp. 1323-1326, North-Holland, Amsterdam, 1990.
34. Ramasubramanian, V., and Paliwal, K. K. An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation. Pattern Recognition Lett. 13(7) (1992), 471-480.
35. Ramasubramanian, V., and Paliwal, K. K. An efficient approximation-elimination algorithm for fast nearest-neighbor search. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, San Francisco, pp. 189-192, Mar. 1992.
36. Van Rijsbergen, C. J. The best-match problem in document retrieval. Commun. ACM 17(11) (1974), 648-649.
37. Seidel, R. A convex hull algorithm for points in even dimensions. Technical Report Comp. Sci. Tech. Rep. 81-14, University of British Columbia, Vancouver, 1981.
38. Seidel, R. The complexity of Voronoi diagrams in higher dimensions. In Proc. 20th Ann. Allerton Conf. Commun. Control and Comput., pp. 94-95, 1982.
39. Shapiro, B. A. The choice of reference points in best-match file searching. Commun. ACM 20(5) (1977), 339-343.
40. Shasha, D., and Wang, Tsong-Li. New techniques for best-match retrieval. ACM Trans. Inform. Syst. 8(2) (1990), 140-158.
41. Soleymani, M. R., and Morgera, S. D. An efficient nearest-neighbour search method. IEEE Trans. Comput. COM-35(6) (1987), 677-679.
42. Soleymani, M. R., and Morgera, S. D. A high speed search algorithm for vector quantization. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 1987, pp. 1946-1948.
43. Soleymani, M. R., and Morgera, S. D. A fast mmse encoding technique for vector quantization. IEEE Trans. Commun. COM-37(6) (1989), 656-659.
44. Vidal, E. An algorithm for finding nearest neighbours in (approximately) constant average time complexity. Inform. Process. Lett. 4(3) (1986), 145-157.
45. Vidal, E., Rulot, H. M., Casacuberta, F., and Benedi, J. M. On the use of a metric-space search algorithm (AESA) for fastdtw-based recognition of isolated words. IEEE Trans. Acoust. Speech Signal Process. 36(5) (1988), 651-660.
46. Watson, D. F. Computing the n-dimensional delaunay tessellation with applications to Voronoi polytopes. Comput. J. 24(2) (1981), 167-172.
47. Yao, A. C. On constructing minimum spanning trees in K-dimensional spaces and related problems. SIAM J. Comput., 11(4) (1982), 721-736.
48. Yao, F. F. Computational geometry. In Handbook of Theoretical Computer Science (J. van Leeuwen, Ed.), pp. 344-389. Elsevier, Amsterdam, 1990.
49. Yunck, T. P. Atechnique to identify nearest-neighbours. IEEE Trans. Syst. Man Cybern. SMC-6(10) (1976), 678-683.
50. Ramasubramanian, V., and Paliwal, K. K. Fast nearest-neighbor search based on Voronoi projections and its application to vector quantization encoding. IEEE Trans. Speech and Audio Processing, 1997 (under review).