Unsupervised Neural Quantization for Compressed-Domain Similarity Search

Stanislav Morozov, Artem Babenko
8/11/2019
cs.LGcs.CVstat.ML

Official code: stanis-morozov/unq (36 stars, last commit 2019-08-15).

Abstract

We tackle the problem of unsupervised visual descriptors compression, which is a key ingredient of large-scale image retrieval systems. While the deep learning machinery has benefited literally all computer vision pipelines, the existing state-of-the-art compression methods employ shallow architectures, and we aim to close this gap by our paper. In more detail, we introduce a DNN architecture for the unsupervised compressed-domain retrieval, based on multi-codebook quantization. The proposed architecture is designed to incorporate both fast data encoding and efficient distances computation via lookup tables. We demonstrate the exceptional advantage of our scheme over existing quantization approaches on several datasets of visual descriptors via outperforming the previous state-of-the-art by a large margin.

View on arXivView PDF

Code Implementations(1)

stanis-morozov/unqOfficial100%

Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search

361C, C++Aug 8, 20197 years ago

Cite this paper

@article{morozov2019unsupervised,
  title  = {Unsupervised Neural Quantization for Compressed-Domain Similarity Search},
  author = {Stanislav Morozov and Artem Babenko},
  year   = {2019},
  eprint = {1908.03883},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1908.03883}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1908.03883.svg)](https://codeofpaper.com/paper/1908.03883)

Discussion