Compact Hash Code Learning with Binary Deep Neural Network



Do, Thanh-Toan ORCID: 0000-0002-6249-0848, Hoang, Tuan, Le Tan, Dang-Khoa, Doan, Anh-Dzung and Cheung, Ngai-Man
(2020) Compact Hash Code Learning with Binary Deep Neural Network. IEEE Transactions on Multimedia, 22 (4). 992 - 1004.

Access the full-text of this item by clicking on the Open Access link.

Abstract

Learning compact binary codes for image retrieval problem using deep neural networks has recently attracted increasing attention. However, training deep hashing networks is challenging due to the binary constraints on the hash codes. In this paper, we propose deep network models and learning algorithms for learning binary hash codes given image representations under both unsupervised and supervised manners. The novelty of our network design is that we constrain one hidden layer to directly output the binary codes. This design has overcome a challenging problem in some previous works: optimizing non-smooth objective functions because of binarization. In addition, we propose to incorporate independence and balance properties in the direct and strict forms into the learning schemes. We also include a similarity preserving property in our objective functions. The resulting optimizations involving these binary, independence, and balance constraints are difficult to solve. To tackle this difficulty, we propose to learn the networks with alternating optimization and careful relaxation. Furthermore, by leveraging the powerful capacity of convolutional neural networks, we propose an end-to-end architecture that jointly learns to extract visual features and produce binary hash codes. Experimental results for the benchmark datasets show that the proposed methods compare favorably or outperform the state of the art.

Item Type: Article
Uncontrolled Keywords: binary constraint optimization, image search, learning to hash
Depositing User: Symplectic Admin
Date Deposited: 18 Feb 2020 10:21
Last Modified: 05 Jan 2022 17:10
DOI: 10.1109/TMM.2019.2935680
Open Access URL: https://arxiv.org/pdf/1712.02956.pdf
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3075417