Binary Representation Via Jointly Personalized Sparse Hashing
2022 · Xiaoqin Wang, Chen Chen, Rushi Lan, et al.
Abstract
Unsupervised hashing has attracted much attention for binary representation learning due to the requirement of economical storage and efficiency of binary codes. It aims to encode high-dimensional features in the Hamming space with similarity preservation between instances. However, most existing methods learn hash functions in manifold-based approaches. Those methods capture the local geometric structures (i.e., pairwise relationships) of data, and lack satisfactory performance in dealing with real-world scenarios that produce similar features (e.g. color and shape) with different semantic information. To address this challenge, in this work, we propose an effective unsupervised method, namely Jointly Personalized Sparse Hashing (JPSH), for binary representation learning. To be specific, firstly, we propose a novel personalized hashing module, i.e., Personalized Sparse Hashing (PSH). Different personalized subspaces are constructed to reflect category-specific attributes for different
Authors
(none)
Tags
Stats
Related papers
- Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
- Shuffle And Learn: Minimizing Mutual Information For Unsupervised Hashing (2020)0.00
- Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
- Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
- Dual Asymmetric Deep Hashing Learning (2018)9.03
- Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
- Learning To Hash With Binary Deep Neural Network (2016)14.93
- Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35