Deep Supervised Hashing Leveraging Quadratic Spherical Mutual Information For Content-based Image Retrieval

Abstract

Several deep supervised hashing techniques have been proposed to allow for efficiently querying large image databases. However, deep supervised image hashing techniques are developed, to a great extent, heuristically often leading to suboptimal results. Contrary to this, we propose an efficient deep supervised hashing algorithm that optimizes the learned codes using an information-theoretic measure, the Quadratic Mutual Information (QMI). The proposed method is adapted to the needs of large-scale hashing and information retrieval leading to a novel information-theoretic measure, the Quadratic Spherical Mutual Information (QSMI). Apart from demonstrating the effectiveness of the proposed method under different scenarios and outperforming existing state-of-the-art image hashing techniques, this paper provides a structured way to model the process of information retrieval and develop novel methods adapted to the needs of each application.

Stats

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

Related papers

• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Metric-learning Based Deep Hashing Network For Content Based Retrieval Of Remote Sensing Images (2019)13.93
• Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
• Exploring Auxiliary Context: Discrete Semantic Transfer Hashing For Scalable Image Retrieval (2019)15.88
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Central Similarity Quantization For Efficient Image And Video Retrieval (2019)23.49
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00