Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint

Abstract

Due to its effectivity and efficiency, deep hashing approaches are widely used for large-scale visual search. However, it is still challenging to produce compact and discriminative hash codes for images associated with multiple semantics for two main reasons, 1) similarity constraints designed in most of the existing methods are based upon an oversimplified similarity assignment(i.e., 0 for instance pairs sharing no label, 1 for instance pairs sharing at least 1 label), 2) the exploration in multi-semantic relevance are insufficient or even neglected in many of the existing methods. These problems significantly limit the discrimination of generated hash codes. In this paper, we propose a novel self-supervised asymmetric deep hashing method with a margin-scalable constraint(SADH) approach to cope with these problems. SADH implements a self-supervised network to sufficiently preserve semantic information in a semantic feature dictionary and a semantic code dictionary for the semantics of

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyyu2020self

Related papers

• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Unsupervised Semantic Deep Hashing (2018)10.48
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Dual Asymmetric Deep Hashing Learning (2018)9.03
• Deep Asymmetric Hashing With Dual Semantic Regression And Class Structure Quantization (2021)6.77
• Deep Cross-modal Hashing Via Margin-dynamic-softmax Loss (2020)0.00
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26