Sciweavers

24 search results - page 1 / 5
» Nearest Neighbours Search Using the PM-Tree
Sort
View
ACSC
2006
IEEE
13 years 11 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
CVPR
1997
IEEE
14 years 7 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
DASFAA
2005
IEEE
111views Database» more  DASFAA 2005»
13 years 10 months ago
Nearest Neighbours Search Using the PM-Tree
Tomás Skopal, Jaroslav Pokorný, V&aa...
PR
2006
132views more  PR 2006»
13 years 4 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
ICPR
2010
IEEE
13 years 5 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina