Sciweavers

Share
3 search results - page 1 / 1
» Spherical hashing
Sort
View
CVPR
2012
IEEE
7 years 6 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
SODA
2016
ACM
66views Algorithms» more  SODA 2016»
3 years 12 months ago
New directions in nearest neighbor searching with applications to lattice sieving
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we propose a method using locality-sensitive filters (LSF), with the property that nearby vectors ha...
Anja Becker, Léo Ducas, Nicolas Gama, Thijs...
ICCV
2003
IEEE
10 years 5 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
books