Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval

Abstract

Deep supervised hashing for image retrieval has attracted researchers' attention due to its high efficiency and superior retrieval performance. Most existing deep supervised hashing works, which are based on pairwise/triplet labels, suffer from the expensive computational cost and insufficient utilization of the semantics information. Recently, deep classwise hashing introduced a classwise loss supervised by class labels information alternatively; however, we find it still has its drawback. In this paper, we propose an improved deep classwise hashing, which enables hashing learning and class centers learning simultaneously. Specifically, we design a two-step strategy on center similarity learning. It interacts with the classwise loss to attract the class center to concentrate on the intra-class samples while pushing other class centers as far as possible. The centers similarity learning contributes to generating more compact and discriminative hashing codes. We conduct experiments on t

Stats

• citations5
• S2 citations—
• github stars0
• HF likes0
• heat score5.84
• arxiv keyzhang2021improved

Related papers

• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Instance-weighted Central Similarity For Multi-label Image Retrieval (2021)0.00
• Improved Deep Hashing With Soft Pairwise Similarity For Multi-label Image Retrieval (2018)16.82
• Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval (2019)0.00
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49