Sciweavers

135 search results - page 10 / 27
» High dimensional nearest neighbor searching
Sort
View
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 24 days 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, ...
CIKM
2000
Springer
13 years 12 months ago
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 15 days ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
PVLDB
2008
232views more  PVLDB 2008»
13 years 6 months ago
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan