A fast nearest neighbor search algorithm based on vector quantization

Details A fast nearest neighbor search algorithm based on vector quantization A fast nearest neighbor search algorithm based on vector quantization

2011-05-25

arxiv.org/abs/1105.4953v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this article, we propose a new fast nearest neighbor search algorithm, based on vector quantization. Like many other branch and bound search algorithms [1,10], a preprocessing recursively partitions the data set into disjointed subsets until the number of points in each part is small enough. In doing so, a search-tree data structure is built. This preliminary recursive data-set partition is based on the vector quantization of the empirical distribution of the initial data-set. Unlike previously cited methods, this kind of partitions does not a priori allow to eliminate several brother nodes in the search tree with a single test. To overcome this difficulty, we propose an algorithm to reduce the number of tested brother nodes to a minimal list that we call "friend Voronoi cells". The complete description of the method requires a deeper insight into the properties of Delaunay triangulations and Voronoi diagrams

Affiliated with

Also associated with

No associations

Rating

A fast nearest neighbor search algorithm based on vector quantization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast nearest neighbor search algorithm based on vector quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast nearest neighbor search algorithm based on vector quantization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190998