Sciweavers

150 search results - page 2 / 30
» Coherency Sensitive Hashing
Sort
View
CVPR
2012
IEEE
11 years 7 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
DMIN
2008
147views Data Mining» more  DMIN 2008»
13 years 6 months ago
Approximate Computation of Object Distances by Locality-Sensitive Hashing
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number ...
Selim Mimaroglu, Dan A. Simovici
IJBC
2007
77views more  IJBC 2007»
13 years 5 months ago
Phase Synchronization and Coherence Analysis: Sensitivity and specificity
Björn Schelter, Matthias Winterhalder, Jens T...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 5 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
14 years 10 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