Binary Code Ranking with Weighted Hamming Distance

Lei Zhang, Yongdong Zhang, Jinhu Tang, Ke Lu, Qi Tian; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 1586-1593


Binary hashing has been widely used for efficient similarity search due to its query and storage efficiency. In most existing binary hashing methods, the high-dimensional data are embedded into Hamming space and the distance or similarity of two points are approximated by the Hamming distance between their binary codes. The Hamming distance calculation is efficient, however, in practice, there are often lots of results sharing the same Hamming distance to a query, which makes this distance measure ambiguous and poses a critical issue for similarity search where ranking is important. In this paper, we propose a weighted Hamming distance ranking algorithm (WhRank) to rank the binary codes of hashing methods. By assigning different bit-level weights to different hash bits, the returned binary codes are ranked at a finer-grained binary code level. We give an algorithm to learn the data-adaptive and query-sensitive weight for each hash bit. Evaluations on two large-scale image data sets demonstrate the efficacy of our weighted Hamming distance for binary code ranking.

Related Material

author = {Zhang, Lei and Zhang, Yongdong and Tang, Jinhu and Lu, Ke and Tian, Qi},
title = {Binary Code Ranking with Weighted Hamming Distance},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2013}