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

作者: V. Ramasubramanian , K.K. Paliwal

DOI: 10.1006/DSPR.1997.0300

关键词: Weighted Voronoi diagramCentroidal Voronoi tessellationComputational geometryVoronoi diagramAlgorithmLloyd's algorithmProximity searchBowyer–Watson algorithmMathematicsNearest neighbor searchSignal processingElectrical and Electronic Engineering

摘要: Abstract In this paper we consider fast nearest-neighbor search techniques based on the projections of Voronoi regions. The diagram a given set points provides an implicit geometric interpretation and serves as important basis for several proximity algorithms in computational geometry developing structure-based vector quantization techniques. provide approximate characterization regions with respect to their locus property localizing small subset codevectors. This can be viewed simplified practically viable equivalent point location using while circumventing complexity full diagram. paper, comprehensive study two projections, namely, box-search mapping table-based context encoding. We also propose effect advantage principal component axes data high degree correlation across components, reducing projections.

参考文章(45)
K. K. Paliwal, W. B. Kleijn, Speech Coding and Synthesis Elsevier Science Inc.. ,(1995)
K. K. Paliwal, V. Ramasubramanian, An efficient approximation-elimination algorithm for fast-nearest-neighbour search international conference on acoustics speech and signal processing. pp. 89- 92 ,(1992)
Allen Gersho, Robert M. Gray, Vector Quantization and Signal Compression ,(1991)
Lee, Preparata, Computational Geometry—A Survey IEEE Transactions on Computers. ,vol. 33, pp. 1072- 1101 ,(1984) , 10.1109/TC.1984.1676388
Dennis Shasha, Tsong-Li Wang, New techniques for best-match retrieval ACM Transactions on Information Systems. ,vol. 8, pp. 140- 158 ,(1990) , 10.1145/96105.96111
Marvin Shapiro, The choice of reference points in best-match file searching Communications of the ACM. ,vol. 20, pp. 339- 343 ,(1977) , 10.1145/359581.359599
W. A. Burkhard, R. M. Keller, Some approaches to best-match file searching Communications of the ACM. ,vol. 16, pp. 230- 236 ,(1973) , 10.1145/362003.362025
K.K. Paliwal, V. Ramasubramanian, Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization IEEE Transactions on Communications. ,vol. 37, pp. 538- 540 ,(1989) , 10.1109/26.24608
C. J. van Rijsbergen, The best-match problem in document retrieval Communications of the ACM. ,vol. 17, pp. 648- 649 ,(1974) , 10.1145/361179.361205
J. Makhoul, S. Roucos, H. Gish, Vector quantization in speech coding Proceedings of the IEEE. ,vol. 73, pp. 1551- 1588 ,(1985) , 10.1109/PROC.1985.13340