Data structures and algorithms for nearest neighbor search in general metric spaces
Peter N. Yianilos
- pp 311-321
Reads0
Chats0
TLDR
The up-tree (vantage point tree) is introduced in several forms, together‘ with &&ciated algorithms, as an improved method for these difficult search problems in general metric spaces.Abstract:
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation 1s very high. Also relevant are high-dimensional Euclidian settings in which the distribution of data is in some sense of lower dimension and embedded in the space. The up-tree (vantage point tree) is introduced in several forms, together‘ with &&ciated algorithms, as an improved method for these difficult search nroblems. Tree construcI tion executes in O(nlog(n i ) time, and search is under certain circumstances and in the imit, O(log(n)) expected time. The theoretical basis for this approach is developed and the results of several experiments are reported. In Euclidian cases, kd-tree performance is compared.read more
Citations
More filters
Journal ArticleDOI
Novel multimedia retrieval technique: progressive query (why wait?)
Serkan Kiranyaz,Moncef Gabbouj +1 more
TL;DR: Experimental progressive query retrieval results show that intermediate retrieval results may be satisfactory and further query processing time may be avoided.
Proceedings ArticleDOI
Global Patch Search Boosts Video Denoising
TL;DR: While with a classical local search their performance is poor, with the proposed global search they even improve the latest state-of-the-art video denoising methods.
Proceedings ArticleDOI
Distributed Sparse Spatial Selection Indexes
TL;DR: This paper proposes the parallelization of a recent pivot-based index data structure which can efficiently accommodate on-line updates and reduces the number of object-to-object comparisons during searches.
Book ChapterDOI
An access structure for similarity search in metric spaces
TL;DR: This paper presents a novel access structure for similarity search in arbitrary metric spaces, called D-Index, which supports easy insertions and deletions and bounded search costs for range queries with radius up to ρ.
Proceedings ArticleDOI
Counting Distance Permutations
TL;DR: This work examines how many distinct permutations can occur as a function of the number of sites and the size of the space, and gives theoretical results for tree metrics and vector spaces with L1, L2, and Linfin metrics.
References
More filters
Book
Introduction to Statistical Pattern Recognition
TL;DR: This completely revised second edition presents an introduction to statistical pattern recognition, which is appropriate as a text for introductory courses in pattern recognition and as a reference book for workers in the field.
Journal ArticleDOI
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Journal ArticleDOI
An Algorithm for Finding Best Matches in Logarithmic Expected Time
TL;DR: An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Journal ArticleDOI
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
TL;DR: The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances.