Semantic Cluster Unary Loss For Efficient Deep Hashing

Abstract

Hashing method maps similar data to binary hashcodes with smaller hamming distance, which has received a broad attention due to its low storage cost and fast retrieval speed. With the rapid development of deep learning, deep hashing methods have achieved promising results in efficient information retrieval. Most of the existing deep hashing methods adopt pairwise or triplet losses to deal with similarities underlying the data, but the training is difficult and less efficient because \(O(n^2)\) data pairs and \(O(n^3)\) triplets are involved. To address these issues, we propose a novel deep hashing algorithm with unary loss which can be trained very efficiently. We first of all introduce a Unary Upper Bound of the traditional triplet loss, thus reducing the complexity to \(O(n)\) and bridging the classification-based unary loss and the triplet loss. Second, we propose a novel Semantic Cluster Deep Hashing (SCDH) algorithm by introducing a modified Unary Upper Bound loss, named Semantic

Stats

• citations10
• S2 citations—
• github stars0
• HF likes0
• heat score7.81
• arxiv keyzhang2018semantic

Related papers

• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Joint Cluster Unary Loss For Efficient Cross-modal Hashing (2019)5.84
• Unsupervised Semantic Deep Hashing (2018)10.48
• Dual Asymmetric Deep Hashing Learning (2018)9.03
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Deep Asymmetric Hashing With Dual Semantic Regression And Class Structure Quantization (2021)6.77
• SHREWD: Semantic Hierarchy-based Relational Embeddings For Weakly-supervised Deep Hashing (2019)0.00