Sciweavers

Share
33 search results - page 1 / 7
» Kernelized Locality-Sensitive Hashing for Scalable Image Sea...
Sort
View
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
13 years 4 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
SIGIR
2012
ACM
10 years 2 months ago
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
Similarity search is a key challenge for multimedia retrieval applications where data are usually represented in high-dimensional space. Among various algorithms proposed for simi...
Hao Xia, Pengcheng Wu, Steven C. H. Hoi, Rong Jin
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
12 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICASSP
2008
IEEE
12 years 6 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
10 years 2 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
books