Simultaneous Compression And Quantization: A Joint Approach For Efficient Unsupervised Hashing

Abstract

For unsupervised data-dependent hashing, the two most important requirements are to preserve similarity in the low-dimensional feature space and to minimize the binary quantization loss. A well-established hashing approach is Iterative Quantization (ITQ), which addresses these two requirements in separate steps. In this paper, we revisit the ITQ approach and propose novel formulations and algorithms to the problem. Specifically, we propose a novel approach, named Simultaneous Compression and Quantization (SCQ), to jointly learn to compress (reduce dimensionality) and binarize input data in a single formulation under strict orthogonal constraint. With this approach, we introduce a loss function and its relaxed version, termed Orthonormal Encoder (OnE) and Orthogonal Encoder (OgE) respectively, which involve challenging binary and orthogonal constraints. We propose to attack the optimization using novel algorithms based on recent advances in cyclic coordinate descent approach. Comprehens

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keyhoang2018simultaneous

Related papers

• Beyond Neighbourhood-preserving Transformations For Quantization-based Unsupervised Hashing (2021)4.52
• Central Similarity Quantization For Efficient Image And Video Retrieval (2019)23.49
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Deep Hashing Via Householder Quantization (2023)0.00
• One Loss For Quantization: Deep Hashing With Discrete Wasserstein Distributional Matching (2022)12.40
• Push For Quantization: Deep Fisher Hashing (2019)0.00
• Deep Asymmetric Hashing With Dual Semantic Regression And Class Structure Quantization (2021)6.77
• Shuffle And Learn: Minimizing Mutual Information For Unsupervised Hashing (2020)0.00