Simultaneous Compression and Quantization: A Joint Approach for Efficient Unsupervised Hashing

02/19/2018
by   Tuan Hoang, et al.
0

The two most important requirements for unsupervised data-dependent hashing methods are to preserve similarity in the low-dimensional feature space and to minimize the binary quantization loss. Even though there are many hashing methods that have been proposed in the literature, there is room for improvement to address both requirements simultaneously and adequately. In this paper, we propose a novel approach, named Simultaneous Compression and Quantization (SCQ), to jointly learn to compress and binarize input data in a single formulation. A simple scale pre-processing is introduced to help to preserve data similarity. With this approach, we introduce a loss function and its relaxed version, termed Orthonormal Encoder (OnE) and Orthogonal Encoder (OgE) respectively, which involve the challenging binary and orthogonal constraints. We then propose novel algorithms that can effectively handle these challenging constraints. Comprehensive experiments on unsupervised image retrieval show that our proposed methods consistently outperform other state-of-the-art hashing methods while still being very computationally-efficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2019

Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning

Representing images by compact hash codes is an attractive approach for ...
research
01/14/2022

ViT2Hash: Unsupervised Information-Preserving Hashing

Unsupervised image hashing, which maps images into binary codes without ...
research
02/21/2018

Binary Constrained Deep Hashing Network for Image Retrieval without Human Intervention

Learning compact binary codes for image retrieval problem using deep neu...
research
05/31/2022

One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching

Image hashing is a principled approximate nearest neighbor approach to f...
research
06/08/2020

Procrustean Orthogonal Sparse Hashing

Hashing is one of the most popular methods for similarity search because...
research
04/06/2017

Enhance Feature Discrimination for Unsupervised Hashing

We introduce a novel approach to improve unsupervised hashing. Specifica...
research
02/02/2019

Supervised Quantization for Similarity Search

In this paper, we address the problem of searching for semantically simi...

Please sign up or login with your details

Forgot password? Click here to reset