Efficient Large-Scale Similarity Search Using Matrix Factorization

Abstract : We consider the image retrieval problem of finding the images in a dataset that are most similar to a query image. Our goal is to reduce the number of vector operations and memory for performing a search without sacrificing accuracy of the returned images. We adopt a group testing formulation and design the decoding architecture using either dictionary learning or eigendecomposition. The latter is a plausible option for small-to-medium sized problems with high-dimensional global image descriptors, whereas dictionary learning is applicable in large-scale scenarios. We evaluate our approach for global descriptors obtained from both SIFT and CNN features.Experiments with standard image search benchmarks, including the Yahoo100M dataset comprising 100 million images, show that our method gives comparable (and sometimes superior) accuracy compared to exhaustive search while requiring only 10% of the vector operations and memory. Moreover, for the same search complexity, our method gives significantly better accuracy compared to approaches based on dimensionality reduction or locality sensitive hashing.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

Contributor : Ahmet Iscen <>
Submitted on : Tuesday, March 29, 2016 - 5:26:02 PM
Last modification on : Thursday, February 7, 2019 - 3:06:19 PM
Long-term archiving on : Thursday, June 30, 2016 - 4:31:39 PM


Files produced by the author(s)


  • HAL Id : hal-01294736, version 1


Ahmet Iscen, Michael Rabbat, Teddy Furon. Efficient Large-Scale Similarity Search Using Matrix Factorization. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Jun 2016, Las Vegas, United States. ⟨hal-01294736⟩



Record views


Files downloads