Deep Supervised Discrete Hashing

Abstract

With the rapid growth of image and video data on the web, hashing has been extensively studied for image or video search in recent years. Benefit from recent advances in deep learning, deep hashing methods have achieved promising results for image retrieval. However, there are some limitations of previous deep hashing methods (e.g., the semantic information is not fully exploited). In this paper, we develop a deep supervised discrete hashing algorithm based on the assumption that the learned binary codes should be ideal for classification. Both the pairwise label information and the classification information are used to learn the hash codes within one stream framework. We constrain the outputs of the last layer to be binary codes directly, which is rarely investigated in deep hashing algorithm. Because of the discrete nature of hash codes, an alternating minimization method is used to optimize the objective function. Experimental results have shown that our method outperforms current

Stats

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

Related papers

• Deep Discrete Supervised Hashing (2017)15.06
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Unsupervised Semantic Deep Hashing (2018)10.48
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24
• 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
• Supervised Hashing With End-to-end Binary Deep Neural Network (2017)2.26