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
Dissertation
A robust motion planning approach for autonomous driving in urban areas
TL;DR: The effectiveness of the Robust RRT algorithm for planning in an urban environment is demonstrated through numerous simulated scenarios and real data corresponding to its implementation in MIT's robotic vehicle that competed in the DARPA Urban Challenge.
Journal ArticleDOI
Margin-Based Pivot Selection for Similarity Search Indexes
TL;DR: Maximal Metric Margin Partitioning (MMMP), a partitioning scheme for similarity search indexes, and an indexing scheme, named the MMMP-Index, which uses MMMP and pivot filtering, which reduces the query execution cost.
Patent
Selecting example-based predictors based on spatial continuity
TL;DR: In this article, an image processing system is provided for encoding images based on example-based compression, which selects a set of candidate dictionary predictor entries to encode a portion of an image based at least in part on the neighbors of the portion.
Journal ArticleDOI
The Utility of Data Transformation for Alignment, De Novo Assembly and Classification of Short Read Virus Sequences
Avraam Tapinos,Bede Constantinides,My V. T. Phan,Samaneh Kouchaki,Matthew Cotten,David Robertson +5 more
TL;DR: The results show that the use of highly compressed sequence approximations can provide accurate results, with analytical performance retained and even enhanced through appropriate dimensionality reduction of sequence data.
Improving Similarity Search in Face-Images Data
Pedro Chambel,Fernanda Barbosa +1 more
TL;DR: This work evaluates the performance of range queries with metric data structures (LAESA, VPtree, DSAT, HDSAT1, H DSAT2, LC, RLC and GNAT) when the metri c spaces are face-images data with the Euclidean distance and results show that all data structures reduce the ratio between the number of distances computed and the database size.
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.