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
Probabilistic Approaches for Pose Estimation
TL;DR: A surgical system that is capable of performing real-time tumor localization, hand-eye calibration, registration of preoperative models to the anatomy, and augmented reality is demonstrated.
Posted Content
Toward Metric Indexes for Incremental Insertion and Querying.
Edward Raff,Charles Nicholas +1 more
TL;DR: This work modify and improve three algorithms to support the scenario of incremental insertion and querying with arbitrary metrics, and evaluates them on multiple datasets and distance metrics while varying the value of $k$ for the desired number of nearest neighbors.
Journal ArticleDOI
Automatic Detection of Internal Copy-Move Forgeries in Images
TL;DR: This article presents an implementation and discussion of the recently proposed ‘Efficient DenseField Copy-move Forgery Detection’ by Cozzolino et al. and extends successfully the method to the use of dense SIFT descriptors and shows that they are better at detecting forgeries using Poisson editing.
Dissertation
Calibration to vanilla and barrier options with the Gyöngy and Brunick-Shreve Markovian projections
TL;DR: In this paper, the authors derive a forward equation for arbitrage-free barrier option prices in continuous semi-martingale models, in terms of Markovian projections of the stochastic volatility process, and derive the necessary and sufficient condition for the exact calibration to up-and-out call options.
Proceedings ArticleDOI
Adaptive Distributed Partitioning in Apache Flink
TL;DR: This work proposes an architecture for allowing adaptations of the workload of each worker in Flink and applies this architecture to a specific use case, namely continuous distancebased outlier detection.
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.