Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 12 - Volume 12
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)
LabelMe: A Database and Web-Based Tool for Image Annotation
International Journal of Computer Vision
International Journal of Approximate Reasoning
Query expansion for hash-based image object retrieval
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Scalable similarity search with optimized kernel hashing
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Product Quantization for Nearest Neighbor Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hypergraph spectral hashing for similarity search of social image
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Multiple feature hashing for real-time large scale near-duplicate video retrieval
MM '11 Proceedings of the 19th ACM international conference on Multimedia
LDAHash: Improved Matching with Smaller Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterative quantization: A procrustean approach to learning binary codes
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Compact hashing with joint optimization of search accuracy and time
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Kernelized Locality-Sensitive Hashing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Manhattan hashing for large-scale image retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Mobile product search with Bag of Hash Bits and boundary reranking
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Supervised hashing with kernels
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Complementary hashing for approximate nearest neighbor search
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Submodular video hashing: a unified framework towards video pooling and indexing
Proceedings of the 20th ACM international conference on Multimedia
Compact kernel hashing with multiple features
Proceedings of the 20th ACM international conference on Multimedia
Sketch-based image retrieval on mobile devices using compact hash bits
Proceedings of the 20th ACM international conference on Multimedia
Multidimensional spectral hashing
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Sequential spectral learning to hash with multiple representations
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Efficient mining of repetitions in large-scale TV streams with product quantization hashing
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
| Hi-index | 0.00 |
In this paper, we propose a novel method to learn similarity-preserving hash functions for approximate nearest neighbor (NN) search. The key idea is to learn hash functions by maximizing the alignment between the similarity orders computed from the original space and the ones in the hamming space. The problem of mapping the NN points into different hash codes is taken as a classification problem in which the points are categorized into several groups according to the hamming distances to the query. The hash functions are optimized from the classifiers pooled over the training points. Experimental results demonstrate the superiority of our approach over existing state-of-the-art hashing techniques.