Sciweavers

Share
7 search results - page 1 / 2
» Bregman vantage point trees for efficient nearest Neighbor Q...
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
8 years 1 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ECCV
2008
Springer
9 years 5 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
COCOON
1998
Springer
8 years 7 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
GIS
2005
ACM
9 years 4 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
8 years 4 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
books