Sciweavers

89 search results - page 8 / 18
» Efficient Search for Approximate Nearest Neighbor in High Di...
Sort
View
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
14 years 2 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 8 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
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...
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
14 years 1 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You