Sciweavers

248 search results - page 17 / 50
» Nearest Neighbor Search on Multimedia Indexing Structures
Sort
View
ICML
2006
IEEE
14 years 5 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 2 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 11 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
ECCV
2008
Springer
14 years 10 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 1 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...