arXiv:2412.12782cs.CV2024-12被引 3

解决细粒度分类中层级语义冲突问题,提升细粒度识别精度。

Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification

  • 从最细粒度到粗粒度逐级构建分类器,实现层级信息双向流动。
  • 在CUB-200-2011数据集上达到93.7%准确率,优于现有方法。
  • 适合需要高精度细粒度分类的视觉任务,如物种识别。

本文针对细粒度分类中的粒度竞争问题,该问题源于多粒度标签间的语义鸿沟。现有方法通常基于共享特征提取器构建独立的层次感知模型,但由于粗粒度类别更易学习,基础编码器倾向于优先学习粗粒度抽象特征,从而阻碍细粒度特征的学习。为此,我们提出一种名为双向逻辑树(Bidirectional Logits Tree, BiLT)的新框架,实现粒度调和。核心思想是按从最细到最粗的粒度顺序依次构建分类器,而非并行使用相同输入特征构建多个分类器。在此设置下,细粒度分类器的输出作为粗粒度分类器的输入,促进不同粒度间层级语义信息的传递。此外,我们进一步引入自适应粒内差异学习(AIGDL)方法,以挖掘同一粒度内类别的细微语义差异。大量实验证明了所提方法的有效性。

原文摘要 · Abstract (English)

This paper addresses the challenge of Granularity Competition in fine-grained classification tasks, which arises due to the semantic gap between multi-granularity labels. Existing approaches typically develop independent hierarchy-aware models based on shared features extracted from a common base encoder. However, because coarse-grained levels are inherently easier to learn than finer ones, the base encoder tends to prioritize coarse feature abstractions, which impedes the learning of fine-grained features. To overcome this challenge, we propose a novel framework called the Bidirectional Logits Tree (BiLT) for Granularity Reconcilement. The key idea is to develop classifiers sequentially from the finest to the coarsest granularities, rather than parallelly constructing a set of classifiers based on the same input features. In this setup, the outputs of finer-grained classifiers serve as inputs for coarser-grained ones, facilitating the flow of hierarchical semantic information across different granularities. On top of this, we further introduce an Adaptive Intra-Granularity Difference Learning (AIGDL) approach to uncover subtle semantic differences between classes within the same granularity. Extensive experiments demonstrate the effectiveness of our proposed method.

细粒度分类层级学习语义调和

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