Supervised hashing with kernels
Columbia University · IBM (United States) · +2 more institutions
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…
Citation impact
- FWCI
- 73.01
- Percentile
- 100%
- References
- 25
Authors
5Topics & keywords
- Hash function
- Computer science
- Discriminative model
- Hamming distance
- Binary code
- Metric (unit)
- Hash table
- Artificial intelligence
- Reduced inequalities