Supervised hashing with kernels

Abstract

Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised information into hash function learning. However, the existing supervised methods either lack adequate performance or often incur cumbersome model training. In this paper, we propose a novel kernel-based supervised hashing model which requires a limited amount of supervised information, i.e., similar and dissimilar data pairs, and a feasible training cost in achieving high quality hashing. The idea is to map the data to compact binary codes whose Hamming distances are minimized on similar pairs and simultaneously maximized on dissimilar pairs. Our approach is distinct from prior works by utilizing the equivalence between optimizing the code inner products and the Hamming distances. This enables us to sequentially and efficiently train the hash functions one bit at a time, yielding very short yet discriminative codes. We carry out extensive experiments on two image benchmarks with up to one million samples, demonstrating that our approach significantly outperforms the state-of-the-arts in searching both metric distance neighbors and semantically similar neighbors, with accuracy gains ranging from 13% to 46%.

DOI: 10.1109/CVPR.2012.6247912
View Slides

Extracted Key Phrases

4 Figures and Tables

05010015020112012201320142015201620172018
Citations per Year

581 Citations

Semantic Scholar estimates that this publication has 581 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Liu2012SupervisedHW, title={Supervised hashing with kernels}, author={Wei Liu and Jun Wang and Rongrong Ji and Yugang Jiang and Shih-Fu Chang}, journal={2012 IEEE Conference on Computer Vision and Pattern Recognition}, year={2012}, pages={2074-2081} }