跳到正文
研踪PaperTrail
← 研踪 PaperTrail

CVF · CVPR 2026:cvf:404d34aaece1cdafc5160b3655268b1d · 记录 #1

Assignment-Driven Hash Learning in a Hyper-Semantic Space for On-the-Fly Category Discovery

来源日期(仅到年份) 2026
来源记录日期 2026
雷达观测 2026-11-05 01:11
CVF · CVPR 2026 ↗PDF ↗

摘要

On-the-fly Category Discovery (OCD) aims to dynamically identify both known and emerging unknown categories from streaming data, using supervision from only a limited set of labeled classes. Despite recent progress, our empirical analysis reveals fundamental limitations: existing methods suffer from cascading feature-to-hash degradation and severe space monopolization by known classes, fundamentally hindering novel category discovery. To address these coupled challenges, we introduce a principled two-stage framework.We first construct a Hyper-Semantic Space with dual geometric subspaces: a Derived Subspace employing parent-derived prototype augmentation to capture intra-class diversity and enhance inter-class discrimination, and a Calibrated Subspace synthesized through cross-prototype interpolation to impose distributional constraints and prevent representational collapse.Within this geometrically-constrained space, we perform Assignment-Driven Hash Learning, where Flexible Prototype Assignment (FPA) models intra-class variations and enhances inter-class separation, alongside Binary Hash Regularization (BHR) to enforce compact and discriminative hash representations. Our framework serves as a plug-and-play module, consistently improving state-of-the-art OCD methods across fine-grained benchmarks. Code will be released upon acceptance.

论文发现出处

这些页面提供论文线索,不代表同行评审或质量认证。

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

发表信息与关联版本

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

平台记录号代表本站观测到的元数据变化,不是作者修订号。来源日期仅到月份或年份时,按该月或该年首日存档。

记录 #1 · 2026 · 最新观测版本

Assignment-Driven Hash Learning in a Hyper-Semantic Space for On-the-Fly Category Discovery

On-the-fly Category Discovery (OCD) aims to dynamically identify both known and emerging unknown categories from streaming data, using supervision from only a limited set of labeled classes. Despite recent progress, our empirical analysis reveals fundamental limitations: existing methods suffer from cascading feature-to-hash degradation and severe space monopolization by known classes, fundamentally hindering novel category discovery. To address these coupled challenges, we introduce a principled two-stage framework.We first construct a Hyper-Semantic Space with dual geometric subspaces: a Derived Subspace employing parent-derived prototype augmentation to capture intra-class diversity and enhance inter-class discrimination, and a Calibrated Subspace synthesized through cross-prototype interpolation to impose distributional constraints and prevent representational collapse.Within this geometrically-constrained space, we perform Assignment-Driven Hash Learning, where Flexible Prototype Assignment (FPA) models intra-class variations and enhances inter-class separation, alongside Binary Hash Regularization (BHR) to enforce compact and discriminative hash representations. Our framework serves as a plug-and-play module, consistently improving state-of-the-art OCD methods across fine-grained benchmarks. Code will be released upon acceptance.

查看此版本解读 →查看此版本原文 ↗