Compact Hash Code Learning With Binary Deep Neural Network

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 dif

Stats

• citations15
• S2 citations—
• github stars0
• HF likes0
• heat score9.03
• arxiv keydo2017compact

Related papers

• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84
• Learning To Hash With Binary Deep Neural Network (2016)14.93
• Supervised Hashing With End-to-end Binary Deep Neural Network (2017)2.26
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Dual Asymmetric Deep Hashing Learning (2018)9.03
• Embarrassingly Simple Binary Representation Learning (2019)9.41
• From Hashing To Cnns: Training Binaryweight Networks Via Hashing (2018)12.40
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19