Order preserving hashing for approximate nearest neighbor search
Open Access
- 21 October 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 133-142
Abstract
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.Keywords
This publication has 26 references indexed in Scilit:
- Sketch-based image retrieval on mobile devices using compact hash bits2012
- Submodular video hashing2012
- Efficient Mining of Repetitions in Large-Scale TV Streams with Product Quantization Hashing2012
- Multidimensional Spectral Hashing2012
- Sequential Spectral Learning to Hash with Multiple Representations2012
- Hypergraph spectral hashing for similarity search of social image2011
- Multiple feature hashing for real-time large scale near-duplicate video retrieval2011
- Scalable similarity search with optimized kernel hashing2010
- Semantic hashingInternational Journal of Approximate Reasoning, 2009
- LabelMe: A Database and Web-Based Tool for Image AnnotationInternational Journal of Computer Vision, 2007