Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss

Abstract

Deep supervised hashing has emerged as an influential solution to large-scale semantic image retrieval problems in computer vision. In the light of recent progress, convolutional neural network based hashing methods typically seek pair-wise or triplet labels to conduct the similarity preserving learning. However, complex semantic concepts of visual contents are hard to capture by similar/dissimilar labels, which limits the retrieval performance. Generally, pair-wise or triplet losses not only suffer from expensive training costs but also lack in extracting sufficient semantic information. In this regard, we propose a novel deep supervised hashing model to learn more compact class-level similarity preserving binary codes. Our deep learning based model is motivated by deep metric learning that directly takes semantic labels as supervised information in training and generates corresponding discriminant hashing code. Specifically, a novel cubic constraint loss function based on Gaussian di

Stats

• citations30
• S2 citations—
• github stars0
• HF likes0
• heat score11.19
• arxiv keyzhe2018deep

Related papers

• Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval (2021)5.84
• Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval (2019)0.00
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Improved Deep Hashing With Soft Pairwise Similarity For Multi-label Image Retrieval (2018)16.82
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Deep Supervised Discrete Hashing (2017)0.00
• Unsupervised Semantic Deep Hashing (2018)10.48
• Semantic Cluster Unary Loss For Efficient Deep Hashing (2018)7.81