Order preserving hashing for approximate nearest neighbor search
Lists
Only you see this
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.
BibTeX
@inproceedings{wang2013order,
author = {Jianfeng Wang and Jingdong Wang and Nenghai Yu and Shipeng Li},
title = {{Order preserving hashing for approximate nearest neighbor search}},
booktitle = {ACM Multimedia},
year = {2013},
doi = {10.1145/2502081.2502100},
}Loading related content...