Scalable Image Retrieval by Sparse Product Quantization
- 3 November 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 19 (3) , 586-597
Abstract
Fast approximate nearest neighbor (ANN) search technique for high-dimensional feature indexing and retrieval is the crux of large-scale image retrieval. A recent promising technique is product quantization, which attempts to index high-dimensional image features by decomposing the feature space into a Cartesian product of low-dimensional subspaces and quantizing each of them separately. Despite the promising results reported, their quantization approach follows the typical hard assignment of traditional quantization methods, which may result in large quantization errors, and thus, inferior search performance. Unlike the existing approaches, in this paper, we propose a novel approach called sparse product quantization (SPQ) to encoding the high-dimensional feature vectors into sparse representation. We optimize the sparse representations of the feature vectors by minimizing their quantization errors, making the resulting representation is essentially close to the original data in practice. Experiments show that the proposed SPQ technique is not only able to compress data, but also an effective encoding technique. We obtain state-of-the-art results for ANN search on four public image datasets and the promising results of content-based image retrieval further validate the efficacy of our proposed method.Keywords
All Related Versions
Funding Information
- National Key Research and Development Program of China (2016YFB1001501)
- Fundamental Research Funds for the Central Universities (2015XZZX005)
This publication has 38 references indexed in Scilit:
- Fast Object Retrieval Using Direct Spatial MatchingIEEE Transactions on Multimedia, 2015
- A Comprehensive Study Over VLAD and Product Quantization in Large-Scale Image RetrievalIEEE Transactions on Multimedia, 2014
- USB: Ultrashort Binary Descriptor for Fast Visual Matching and RetrievalIEEE Transactions on Image Processing, 2014
- Scalable Nearest Neighbor Algorithms for High Dimensional DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Discrete Cosine Transform Locality-Sensitive Hashes for Face RetrievalIEEE Transactions on Multimedia, 2014
- Optimized Product QuantizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- LabelMe: A Database and Web-Based Tool for Image AnnotationInternational Journal of Computer Vision, 2007
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Extensions of Lipschitz mappings into a Hilbert space1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975