提出原型哈希编码方法,提升细粒度类别发现的准确性和鲁棒性。
Prototypical Hash Encoding for On-the-Fly Fine-Grained Category Discovery
- 用多原型表示类别,捕捉类内多样性
- 通过原型引导哈希编码,提升分类区分度
- 可解释原型帮助理解样本归属判断机制
本文研究一种实用但具有挑战性的在线类别发现(OCD)任务,旨在仅依赖已知类别标注数据,实时识别新到来的数据中属于已知或未知类别的样本。现有方法使用哈希编码进行实例级推理,但直接将特征映射到低维哈希空间会损害类别区分能力,并引发对细粒度类别的高敏感性问题。为此,我们提出新型原型哈希编码(PHE)框架,包含类别感知原型生成(CPG)和判别性类别编码(DCE),以两阶段投影方式缓解哈希码敏感性,同时保留高维特征中的丰富判别信息。CPG通过多个原型表征每类,充分捕捉类内差异;DCE在生成原型指导和最小分离距离约束下增强哈希码的判别力。联合优化使两者相互促进,显著提升性能。大量实验表明,相比以往方法,PHE在所有数据集上的平均整体准确率提升5.3%。此外,由于原型具有可解释性,我们可视化分析了其如何帮助样本被归入已知或未知类别。代码已开源。
原文摘要 · Abstract (English)
In this paper, we study a practical yet challenging task, On-the-fly Category Discovery (OCD), aiming to online discover the newly-coming stream data that belong to both known and unknown classes, by leveraging only known category knowledge contained in labeled data. Previous OCD methods employ the hash-based technique to represent old/new categories by hash codes for instance-wise inference. However, directly mapping features into low-dimensional hash space not only inevitably damages the ability to distinguish classes and but also causes "high sensitivity" issue, especially for fine-grained classes, leading to inferior performance. To address these issues, we propose a novel Prototypical Hash Encoding (PHE) framework consisting of Category-aware Prototype Generation (CPG) and Discriminative Category Encoding (DCE) to mitigate the sensitivity of hash code while preserving rich discriminative information contained in high-dimension feature space, in a two-stage projection fashion. CPG enables the model to fully capture the intra-category diversity by representing each category with multiple prototypes. DCE boosts the discrimination ability of hash code with the guidance of the generated category prototypes and the constraint of minimum separation distance. By jointly optimizing CPG and DCE, we demonstrate that these two components are mutually beneficial towards an effective OCD. Extensive experiments show the significant superiority of our PHE over previous methods, e.g., obtaining an improvement of +5.3% in ALL ACC averaged on all datasets. Moreover, due to the nature of the interpretable prototypes, we visually analyze the underlying mechanism of how PHE helps group certain samples into either known or unknown categories. Code is available at https://github.com/HaiyangZheng/PHE.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。