Query-adaptive Image Retrieval By Deep Weighted Hashing

Abstract

Hashing methods have attracted much attention for large scale image retrieval. Some deep hashing methods have achieved promising results by taking advantage of the strong representation power of deep networks recently. However, existing deep hashing methods treat all hash bits equally. On one hand, a large number of images share the same distance to a query image due to the discrete Hamming distance, which raises a critical issue of image retrieval where fine-grained rankings are very important. On the other hand, different hash bits actually contribute to the image retrieval differently, and treating them equally greatly affects the retrieval accuracy of image. To address the above two problems, we propose the query-adaptive deep weighted hashing (QaDWH) approach, which can perform fine-grained ranking for different queries by weighted Hamming distance. First, a novel deep hashing network is proposed to learn the hash codes and corresponding class-wise weights jointly, so that the lea

Stats

• citations48
• S2 citations—
• github stars0
• HF likes0
• heat score12.68
• arxiv keyzhang2016query

Related papers

• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search (2019)13.74
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Attribute-aware Deep Hashing With Self-consistency For Large-scale Fine-grained Image Retrieval (2023)11.76
• Hybridhash: Hybrid Convolutional And Self-attention Deep Hashing For Image Retrieval (2024)12.56
• Improved Deep Hashing With Soft Pairwise Similarity For Multi-label Image Retrieval (2018)16.82
• Deep Reinforcement Learning For Image Hashing (2018)12.25