Beyond Neighbourhood-preserving Transformations For Quantization-based Unsupervised Hashing

Abstract

An effective unsupervised hashing algorithm leads to compact binary codes preserving the neighborhood structure of data as much as possible. One of the most established schemes for unsupervised hashing is to reduce the dimensionality of data and then find a rigid (neighbourhood-preserving) transformation that reduces the quantization error. Although employing rigid transformations is effective, we may not reduce quantization loss to the ultimate limits. As well, reducing dimensionality and quantization loss in two separate steps seems to be sub-optimal. Motivated by these shortcomings, we propose to employ both rigid and non-rigid transformations to reduce quantization error and dimensionality simultaneously. We relax the orthogonality constraint on the projection in a PCA-formulation and regularize this by a quantization term. We show that both the non-rigid projection matrix and rotation matrix contribute towards minimizing quantization loss but in different ways. A scalable nested c

Stats

• citations3
• S2 citations—
• github stars0
• HF likes0
• heat score4.52
• arxiv keyhemati2021beyond

Related papers

• Simultaneous Compression And Quantization: A Joint Approach For Efficient Unsupervised Hashing (2018)7.50
• One Loss For Quantization: Deep Hashing With Discrete Wasserstein Distributional Matching (2022)12.40
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Deep Hashing Via Householder Quantization (2023)0.00
• Shuffle And Learn: Minimizing Mutual Information For Unsupervised Hashing (2020)0.00
• Push For Quantization: Deep Fisher Hashing (2019)0.00
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Sparse-inductive Generative Adversarial Hashing For Nearest Neighbor Search (2023)0.00