Sciweavers

285 search results - page 32 / 57
» Approximate Nearest Neighbor Searching in Multimedia Databas...
Sort
View
ICASSP
2011
IEEE
13 years 4 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
CVPR
2004
IEEE
14 years 9 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
ER
2004
Springer
144views Database» more  ER 2004»
14 years 1 months ago
Expressing and Optimizing Similarity-Based Queries in SQL
Searching for similar objects (in terms of near and nearest neighbors) of a given query object from a large set is an essential task in many applications. Recent years have seen g...
Like Gao, Min Wang, Xiaoyang Sean Wang, Sriram Pad...
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
13 years 12 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick