Compact Hash Codes for Efficient Visual Descriptors Retrieval in Large Scale Databases

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on multimedia 2017-11, Vol.19 (11), p.2521-2532
Main Authors: Ercoli, Simone, Bertini, Marco, Del Bimbo, Alberto
Format: Article
Language:English
Subjects:
Artificial neural networks
Convolutional neural network (CNN)
Datasets
hashing
Image retrieval
Indexing
nearest neighbor search
Neural networks
Retrieval
SIFT
Vector quantization
Visualization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 standard datasets of engineered features of up to one billion descriptors (BIGANN) and, supported by recent progress in convolutional neural networks (CNNs), on CIFAR-10, MNIST, INRIA Holidays, Oxford 5K, and Paris 6K datasets; also, the recent DEEP1B dataset, composed by one billion CNN-based features, has been used. 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.
ISSN:1520-9210
1941-0077
DOI:10.1109/TMM.2017.2697824