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
Book ChapterDOI
Metrics and Ambits and Sprawls, Oh My
TL;DR: This paper walks through the classic structures of metric indexing, placing them all in the context of the recently proposed "sprawl of ambits" framework.
Journal ArticleDOI
Local Feature Descriptor Indexing for Image Matching and Object Detection in Real-Time Applications
TL;DR: Possible ways to optimize matching for frame alignment and object detection applications using Vantage-Point tree indexing to optimize pairwise keypoint matching, and image keypoint graph indexed to optimize pose estimation are discussed.
Proceedings ArticleDOI
Embedding hierarchical signal to siamese network for fast name rectification
TL;DR: This proposed framework embeds name strings into vectors for representing distance relation in a latent space using character n-gram and locality-sensitive hashing (LSH), and then finds the most similar signal using nearest neighbor search (NNS) and detailed search.
Proceedings ArticleDOI
UFvH: Unified Feature Video Hashing for Near-Duplicate Video Retrieval
TL;DR: In the proposed framework, multiple features are project into a unified space to construct a fusion feature called unified feature on the basis of multi-view canonical correlation analysis (MCCA), and then the video-level hash is learned based on natural binary code and K-means clustering.
Chapter 3 Geometric Structure of High- Dimensional Data
TL;DR: This chapter introduces the methods for defining the data similarity (or dissimilarity) and the preliminary spectral graph theory to analyze the data geometry and introduces the Laplacian on a graph.
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.