Efficient Image Retrieval Using Multi Neural Hash Codes And Bloom Filters

Abstract

This paper aims to deliver an efficient and modified approach for image retrieval using multiple neural hash codes and limiting the number of queries using bloom filters by identifying false positives beforehand. Traditional approaches involving neural networks for image retrieval tasks tend to use higher layers for feature extraction. But it has been seen that the activations of lower layers have proven to be more effective in a number of scenarios. In our approach, we have leveraged the use of local deep convolutional neural networks which combines the powers of both the features of lower and higher layers for creating feature maps which are then compressed using PCA and fed to a bloom filter after binary sequencing using a modified multi k-means approach. The feature maps obtained are further used in the image retrieval process in a hierarchical coarse-to-fine manner by first comparing the images in the higher layers for semantically similar images and then gradually moving towards

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keychakrabarti2020efficient

Related papers

• Bloom Filters And Compact Hash Codes For Efficient And Distributed Image Retrieval (2016)6.34
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
• Neurohash: A Hyperdimensional Neuro-symbolic Framework For Spatially-aware Image Hashing And Retrieval (2024)0.00
• Leveraging High-resolution Features For Improved Deep Hashing-based Image Retrieval (2024)4.52
• Simultaneous Region Localization And Hash Coding For Fine-grained Image Retrieval (2019)0.00
• Hybridhash: Hybrid Convolutional And Self-attention Deep Hashing For Image Retrieval (2024)12.56
• Compact Hash Codes For Efficient Visual Descriptors Retrieval In Large Scale Databases (2016)11.76
• From Selective Deep Convolutional Features To Compact Binary Representations For Image Retrieval (2018)10.35