Compact Hash Codes For Efficient Visual Descriptors Retrieval In Large Scale Databases

Abstract

In this paper we present an efficient method for visual descriptors retrieval based on compact hash codes computed using a multiple k-means assignment. The method has been applied to the problem of approximate nearest neighbor (ANN) search of local and global visual content descriptors, and it has been tested on different datasets: three large scale public datasets of up to one billion descriptors (BIGANN) and, supported by recent progress in convolutional neural networks (CNNs), also on the CIFAR-10 and MNIST datasets. Experimental results show that, despite its simplicity, the proposed method obtains a very high performance that makes it superior to more complex state-of-the-art methods.

Stats

• citations36
• S2 citations—
• github stars0
• HF likes0
• heat score11.76
• arxiv keyercoli2016compact

Related papers

• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search (2019)13.74
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Bloom Filters And Compact Hash Codes For Efficient And Distributed Image Retrieval (2016)6.34
• Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
• Attribute-aware Deep Hashing With Self-consistency For Large-scale Fine-grained Image Retrieval (2023)11.76
• Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00