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
The Tangent Earth Mover’s Distance
Ofir Pele,Ben Taskar +1 more
TL;DR: The TEMD is a generalization of the Earth Mover’s Distance that is invariant to some global transformations that is robust to local deformations and robuster to global transformations such as global translations and rotations of the whole image.
Posted Content
Algorithmic Detection of Computer Generated Text
TL;DR: The results show that taking the formatting and contextual clues offered by online groups, message boards and social news sites into account may be of central importance when selecting features with which to identify such unwanted postings.
Contributions à la reconnaissance de l'écriture cursive à l'aide des modèles de Markov cachés
TL;DR: Diverses ameliorations sont apportees pour chacun of ces trois themes d'un mot manuscrit, depuis le traitement de l'image jusqu'au resultat final.
Proceedings ArticleDOI
Speeding Up Permutation Based Indexing with Indexing
Karina Figueroa,Kimmo Frediksson +1 more
TL;DR: A recent probabilistic approach for searching in high dimensional metric spaces is based on predicting the distances between database elements according to how they order their distances towards some set of distinguished elements, called permutants, but this work is improved by identifying and solving this as another metric space problem.
Journal ArticleDOI
Content-based video retrieval in historical collections of the German Broadcasting Archive
Markus Mühling,Manja Meister,Nikolaus Korfhage,Jörg Wehling,Angelika Hörth,Ralph Ewerth,Bernd Freisleben +6 more
TL;DR: A system for automatic video content analysis and retrieval to facilitate search in historical collections of GDR television recordings is presented, which relies on a distributed, service-oriented architecture and includes video analysis algorithms for shot boundary detection, concept classification, person recognition, text recognition and similarity search.
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.