Dual Asymmetric Deep Hashing Learning

Abstract

Due to the impressive learning power, deep learning has achieved a remarkable performance in supervised hash function learning. In this paper, we propose a novel asymmetric supervised deep hashing method to preserve the semantic structure among different categories and generate the binary codes simultaneously. Specifically, two asymmetric deep networks are constructed to reveal the similarity between each pair of images according to their semantic labels. The deep hash functions are then learned through two networks by minimizing the gap between the learned features and discrete codes. Furthermore, since the binary codes in the Hamming space also should keep the semantic affinity existing in the original space, another asymmetric pairwise loss is introduced to capture the similarity between the binary codes and real-value features. This asymmetric loss not only improves the retrieval performance, but also contributes to a quick convergence at the training phase. By taking advantage of

Stats

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

Related papers

• Deep Asymmetric Hashing With Dual Semantic Regression And Class Structure Quantization (2021)6.77
• Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Learning To Hash With Binary Deep Neural Network (2016)14.93
• Deep Supervised Discrete Hashing (2017)0.00
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40