Bloom Filters And Compact Hash Codes For Efficient And Distributed Image Retrieval

Abstract

This paper presents a novel method for efficient image retrieval, based on a simple and effective hashing of CNN features and the use of an indexing structure based on Bloom filters. These filters are used as gatekeepers for the database of image features, allowing to avoid to perform a query if the query features are not stored in the database and speeding up the query process, without affecting retrieval performance. Thanks to the limited memory requirements the system is suitable for mobile applications and distributed databases, associating each filter to a distributed portion of the database. Experimental validation has been performed on three standard image retrieval datasets, outperforming state-of-the-art hashing methods in terms of precision, while the proposed indexing method obtains a \(2\times\) speedup.

Stats

• citations6
• S2 citations—
• github stars0
• HF likes0
• heat score6.34
• arxiv keysalvi2016bloom

Related papers

• Efficient Image Retrieval Using Multi Neural Hash Codes And Bloom Filters (2020)2.26
• Compact Hash Codes For Efficient Visual Descriptors Retrieval In Large Scale Databases (2016)11.76
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• From Selective Deep Convolutional Features To Compact Binary Representations For Image Retrieval (2018)10.35
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
• Efficient Bitmap-based Indexing And Retrieval Of Similarity Search Image Queries (2019)0.00
• Efficient Diffusion On Region Manifolds: Recovering Small Objects With Compact CNN Representations (2016)15.83
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61