Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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 scenario. We evaluate our approach both for global descriptors obtained from 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 :
Reports (Research report)
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Ahmet Iscen Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2015 - 7:19:51 PM
Last modification on : Wednesday, October 26, 2022 - 8:14:21 AM
Long-term archiving on: : Saturday, April 29, 2017 - 8:22:17 PM


Files produced by the author(s)


  • HAL Id : hal-01238242, version 2


Ahmet Iscen, Michael Rabbat, Teddy Furon. Efficient Large-Scale Similarity Search Using Matrix Factorization. [Research Report] 8820, INRIA; MCGILL UNIVERSITY. 2015. ⟨hal-01238242v2⟩



Record views


Files downloads