Sciweavers

80 search results - page 11 / 16
» Nearest Neighbor Search Using Additive Binary Tree
Sort
View
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
14 years 1 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
VLDB
1999
ACM
151views Database» more  VLDB 1999»
14 years 3 days ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
DEXA
2010
Springer
187views Database» more  DEXA 2010»
13 years 5 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
CVPR
2007
IEEE
14 years 10 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell