Complementary hashing for approximate nearest neighbor search

Authors:
Hao Xu;Jingdong Wang; Zhu Li;Gang Zeng; Shipeng Li; Nenghai Yu
Affiliations:
MOE-MS KeyLab of MCC, University of Science and Technology of China, China;Microsoft Research Asia, China;Core Networks Research, Huawei Technology, USA;Key Laboratory of Machine Perception, Peking University, China;Microsoft Research Asia, China;MOE-MS KeyLab of MCC, University of Science and Technology of China, China
Venue:
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Year:
2011

Citing 0
Cited 8

Manhattan hashing for large-scale image retrieval

SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Query-driven iterated neighborhood graph search for large scale indexing

Proceedings of the 20th ACM international conference on Multimedia
Similar image search with a tiny bag-of-delegates representation

Proceedings of the 20th ACM international conference on Multimedia
Scalable similar image search by joint indices

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
Order preserving hashing for approximate nearest neighbor search

Proceedings of the 21st ACM international conference on Multimedia
Large-scale image retrieval based on boosting iterative quantization hashing with query-adaptive reranking

Neurocomputing
Smart hashing update for fast response

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral Hashing, expects better performance than the data-blind counterparts, e.g., Locality Sensitive Hashing (LSH). However, most data-dependent hashing methods only employ a single hash table. When higher recall is desired, they have to retrieve exponentially growing number of hash buckets around the bucket containing the query, which may drag down the precision rapidly. In this paper, we propose a so-called complementary hashing approach, which is able to balance the precision and recall in a more effective way. The key idea is to employ multiple complementary hash tables, which are learned sequentially in a boosting manner, so that, given a query, its true nearest neighbors missed from the active bucket of one hash table are more likely to be found in the active bucket of the next hash table. Compared with LSH that also can exploit multiple hash tables, our approach is more effective to find true NNs, thanks to the complementarity property of the hash tables from our approach. Experimental results on large scale ANN search show that the proposed method significantly improves the performance and outperforms the state-of-the-art.