/Error Correction Maximization for Deep Image Hashing

Error Correction Maximization for Deep Image Hashing

Xiang Xu, Xiaofang Wang and Kris Kitani
Conference Paper, British Machine Vision Conference (BMVC 2018), September, 2018

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

We propose to use the concept of the Hamming bound to derive the optimal criteria for learning hash codes with a deep network. In particular, when the number of binary hash codes (typically the number of image categories) and code length are known, it is possible to derive an upper bound on the minimum Hamming distance between the hash codes. This upper bound can then be used to define the loss function for learning hash codes. By encouraging the margin (minimum Hamming distance) between the hash codes of different image categories to match the upper bound, we are able to learn theoretically optimal hash codes. Our experiments show that our method significantly outperforms competing deep learning-based approaches and obtains top performance on benchmark datasets.

BibTeX Reference
@conference{Xu-2018-109779,
author = {Xiang Xu and Xiaofang Wang and Kris Kitani},
title = {Error Correction Maximization for Deep Image Hashing},
booktitle = {British Machine Vision Conference (BMVC 2018)},
year = {2018},
month = {September},
}
2018-11-06T16:37:32+00:00