arXiv:2603.14240cs.CV2026-03

提出首个细粒度跨域新类发现统一框架,解决真实场景下模型泛化难题。

FOCUS: Bridging Fine-Grained Recognition and Open-World Discovery across Domains

  • 单阶段融合几何稳定部件发现与不确定性引导特征增强
  • 在细粒度数据集上比现有方法高3.28%~9.68%的聚类准确率
  • 计算效率达当前最优水平近3倍,适合实际部署

我们提出首个面向细粒度跨域广义类别发现(FG-DG-GCD)的统一框架,使开放世界识别更贴近真实应用中的领域偏移场景。不同于传统GCD假设标注与未标注数据同分布,DG-GCD仅使用源域标注数据,需在未见目标域中同时识别已知类别并发现新类别。该问题在细粒度场景尤为困难,因类间差异微小、类内变化大,导致领域泛化难度剧增。为此,我们构建首个FG-DG-GCD基准,通过受控扩散适配器风格化,在CUB-200-2011、Stanford Cars和FGVC-Aircraft上生成保持身份一致的绘画与草图域。在此基础上,提出FoCUS框架,结合领域一致部件发现(DCPD)实现几何稳定部件推理,以及不确定性感知特征增强(UFA),通过不确定性引导扰动进行置信度校准的特征正则化。大量实验表明,FoCUS在所提基准上相较强基线在聚类准确率上提升3.28%(对比GCD)、9.68%(对比FG-GCD)、2.07%(对比DG-GCD),且在粗粒度DG-GCD任务上仍具竞争力,计算效率为当前最优方案近3倍。

原文摘要 · Abstract (English)

We introduce the first unified framework for *Fine-Grained Domain-Generalized Generalized Category Discovery* (FG-DG-GCD), bringing open-world recognition closer to real-world deployment under domain shift. Unlike conventional GCD, which assumes labeled and unlabeled data come from the same distribution, DG-GCD learns only from labeled source data and must both recognize known classes and discover novel ones in unseen, unlabeled target domains. This problem is especially challenging in fine-grained settings, where subtle inter-class differences and large intra-class variation make domain generalization significantly harder. To support systematic evaluation, we establish the first *FG-DG-GCD benchmarks* by creating identity-preserving *painting* and *sketch* domains for CUB-200-2011, Stanford Cars, and FGVC-Aircraft using controlled diffusion-adapter stylization. On top of this ,we propose FoCUS, a single-stage framework that combines *Domain-Consistent Parts Discovery* (DCPD) for geometry-stable part reasoning with *Uncertainty-Aware Feature Augmentation* (UFA) for confidence-calibrated feature regularization through uncertainty-guided perturbations. Extensive experiments show that FoCUS outperforms strong GCD, FG-GCD, and DG-GCD baselines by **3.28%**, **9.68%**, and **2.07%**, respectively, in clustering accuracy on the proposed benchmarks. It also remains competitive on coarse-grained DG-GCD tasks while achieving nearly **3x** higher computational efficiency than the current state of the art. ^[Code and datasets will be released upon acceptance.]

细粒度识别跨域发现开放世界特征增强

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。