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
Posted Content
Supermetric Search
TL;DR: In this article, the authors examined a class of semimetric space which is finitely four-embeddable in three-dimensional Euclidean space and showed a new best performance for exact search using a well-known benchmark.
Dissertation
Deformable lung registration for pulmonary image analysis of MRI and CT scans
TL;DR: The two most important contributions made in this thesis are the formulation of a multi-dimensional structural image representation, which is independent of modality, robust to intensity distortions and very discriminative for different image features, and a discrete optimisation framework, based on an image-adaptive graph structure, which enables a very efficient optimisation of large dense displacement spaces and deals well with sliding motion.
Journal ArticleDOI
Zero-Shot Learning to Index on Semantic Trees for Scalable Image Retrieval
TL;DR: This study develops a new approach, called zero-shot learning to index on semantic trees (LTI-ST), for efficient image indexing and scalable image retrieval which learns to model the inherent correlation structure between visual representations using a binary semantic tree from training images.
Proceedings ArticleDOI
IoT: Smart City Parking Solutions with Metric-Chisini-Jensen-Shannon Divergence based Kernels
Piyush K. Sharma,Adrienne Raglin +1 more
TL;DR: While clustering is unable to detect visually identifiable clusters, M-CJSDs were able to capture underlying data regularity and give statistically significant improvement over DNN model, and a family of new kernels are proposed, based on metric JSD and Chisini mean.
Proceedings ArticleDOI
A dynamic content-based indexing method for multimedia databases: hierarchical cellular tree
Serkan Kiranyaz,Moncef Gabbouj +1 more
TL;DR: A pre-emptive cell search mechanism is introduced in order to prevent the corruption of large multimedia item collections due to the limited discrimination obtained from the visual and aural descriptors.
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.