Sciweavers

133 search results - page 23 / 27
» Approximate Nearest Subspace Search
Sort
View
DAGM
2009
Springer
14 years 2 months ago
Markerless 3D Face Tracking
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...
Christian Walder, Martin Breidt, Heinrich H. B&uum...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 9 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
CVPR
2012
IEEE
11 years 10 months ago
The inverted multi-index
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
Artem Babenko, Victor S. Lempitsky