Sciweavers

120 search results - page 14 / 24
» Complementary Hashing for Approximate Nearest Neighbor Searc...
Sort
View
135
Voted
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 7 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
135
Voted
ECCV
2006
Springer
16 years 5 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
166
Voted
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 7 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...
154
Voted
ENGL
2008
160views more  ENGL 2008»
15 years 3 months ago
Vector Approximation based Indexing for High-Dimensional Multimedia Databases
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
Imane Daoudi, Saîd El Alaoui Ouatik, A. El K...
131
Voted
AAAI
2012
13 years 6 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li