Deep Hashing With Semantic Hash Centers For Image Retrieval

Abstract

Deep hashing is an effective approach for large-scale image retrieval. Current methods are typically classified by their supervision types: point-wise, pair-wise, and list-wise. Recent point-wise techniques (e.g., CSQ, MDS) have improved retrieval performance by pre-assigning a hash center to each class, enhancing the discriminability of hash codes across various datasets. However, these methods rely on data-independent algorithms to generate hash centers, which neglect the semantic relationships between classes and may degrade retrieval performance. This paper introduces the concept of semantic hash centers, building on the idea of traditional hash centers. We hypothesize that hash centers of semantically related classes should have closer Hamming distances, while those of unrelated classes should be more distant. To this end, we propose a three-stage framework, SHC, to generate hash codes that preserve semantic structure. First, we develop a classification network to identify sem

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keychen2025deep

Related papers

• Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval (2021)5.84
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Semantic Hierarchy Preserving Deep Hashing For Large-scale Image Retrieval (2019)5.24
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Unsupervised Semantic Deep Hashing (2018)10.48
• Deep Supervised Discrete Hashing (2017)0.00
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68