UniHash: Unifying Pointwise and Pairwise Hashing Paradigms
Not on the map. Why?
Abstract (arXiv)
Effective retrieval across both seen and unseen categories is crucial for modern image retrieval systems. Retrieval on seen categories ensures precise recognition of known classes, while retrieval on unseen categories promotes generalization to novel classes with limited supervision. However, most existing deep hashing methods are confined to a single training paradigm, either pointwise or pairwise, where the former excels on seen categories and the latter generalizes better to unseen ones. To overcome this limitation, we propose Unified Hashing (UniHash), a dual-branch framework that unifies the strengths of both paradigms to achieve balanced retrieval performance across seen and unseen categories. UniHash consists of two complementary branches: a center-based branch following the pointwise paradigm and a pairwise branch following the pairwise paradigm. A novel hash code learning method is introduced to enable bidirectional knowledge transfer between branches, improving hash code discriminability and generalization. It employs a mutual learning loss to align hash representations and introduces a Split-Merge Mixture of Hash Experts (SM-MoH) module to enhance cross-branch exchange of hash representations. Theoretical analysis substantiates the effectiveness of UniHash, and extensive experiments on CIFAR-10, MSCOCO, and ImageNet demonstrate that UniHash consistently achieves state-of-the-art performance in both seen and unseen image retrieval scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 14 Jan 2026.
Builds on
22 of 50 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2021Scaling Vision with Sparse Mixture of Expertscited by 747
- 2017Deep Mutual Learningcited by 628
- 2017HashNet: Deep Learning to Hash by Continuationcited by 122
- 2021Novel Visual Category Discovery with Dual Ranking Statistics and Mutual Knowledge Distillationcited by 104
- 2019Central Similarity Quantization for Efficient Image and Video Retrievalcited by 77
- 2015Feature Learning based Deep Supervised Hashing with Pairwise Labelscited by 59
- 2021Intra-Inter Camera Similarity for Unsupervised Person Re-Identificationcited by 52
- 2021One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objectivecited by 43
- 2017Asymmetric Deep Supervised Hashingcited by 35
10 more
- 2016Deep Supervised Hashing with Triplet Labelscited by 27
- 2019Triplet-Based Deep Hashing Network for Cross-Modal Retrievalcited by 26
- 2023Mitigating Test-Time Bias for Fair Image Retrievalcited by 20
- 2023FORB: A Flat Object Retrieval Benchmark for Universal Image Embeddingcited by 9
- 2023Attribute-Aware Deep Hashing with Self-Consistency for Large-Scale Fine-Grained Image Retrievalcited by 8
- 2022Improving Pseudo Labels With Intra-Class Similarity for Unsupervised Domain Adaptationcited by 7
- 2025A Mutual Learning Method for Salient Object Detection with intertwined Multi-Supervision--Revisedcited by 6
- 2023Attributes Grouping and Mining Hashing for Fine-Grained Image Retrievalcited by 5
- 2016Correlation Hashing Network for Efficient Cross-Modal Retrievalcited by 3
- 2024Nested Hash Layer: A Plug-and-play Module for Multiple-length Hash Code Learningcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.