统一点对与成对哈希,提升图像检索在已知和未知类别上的表现。
UniHash: Unifying Pointwise and Pairwise Hashing Paradigms
- 双分支结构融合点对与成对学习,兼顾精度与泛化能力。
- 在CIFAR-10、MSCOCO和ImageNet上均达到顶尖性能。
- 适合需要跨类别泛化的图像检索系统使用。
在已知和未知类别上实现高效检索是现代图像检索系统的关键。对已知类别的检索确保对已知类的精确识别,而对未知类别的检索则促进在有限监督下对新类别的泛化能力。然而,大多数现有深度哈希方法局限于单一训练范式——点对或成对,前者在已知类别上表现优异,后者在未知类别上更具泛化性。为此,我们提出统一哈希(UniHash),一种融合两种范式优势的双分支框架,以实现已知与未知类别间平衡的检索性能。UniHash包含两个互补分支:基于中心的点对分支和成对分支。通过一种新型哈希码学习方法,实现两分支间的双向知识迁移,提升哈希码的判别力与泛化性。该方法采用互学习损失对齐哈希表示,并引入拆分-合并哈希专家混合(SM-MoH)模块增强跨分支信息交换。理论分析证实了其有效性,大量实验在CIFAR-10、MSCOCO和ImageNet上表明,UniHash在已知与未知图像检索场景中始终达到领先性能。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。