Multiple Code Hashing For Efficient Image Retrieval

Abstract

Due to its low storage cost and fast query speed, hashing has been widely used in large-scale image retrieval tasks. Hash bucket search returns data points within a given Hamming radius to each query, which can enable search at a constant or sub-linear time cost. However, existing hashing methods cannot achieve satisfactory retrieval performance for hash bucket search in complex scenarios, since they learn only one hash code for each image. More specifically, by using one hash code to represent one image, existing methods might fail to put similar image pairs to the buckets with a small Hamming distance to the query when the semantic information of images is complex. As a result, a large number of hash buckets need to be visited for retrieving similar images, based on the learned codes. This will deteriorate the efficiency of hash bucket search. In this paper, we propose a novel hashing framework, called multiple code hashing (MCH), to improve the performance of hash bucket search. The

Stats

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

Related papers

• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• Exploring Auxiliary Context: Discrete Semantic Transfer Hashing For Scalable Image Retrieval (2019)15.88
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Correlation Hashing Network For Efficient Cross-modal Retrieval (2016)11.67
• Simultaneous Region Localization And Hash Coding For Fine-grained Image Retrieval (2019)0.00