自适应聚类让模型自动发现新类别,无需预设数量。
Component Adaptive Clustering for Generalized Category Discovery
- 用动态槽注意力自适应确定聚类数,不需预设类别数。
- 在多个数据集上优于现有方法,尤其在细粒度场景表现突出。
- 适合开放世界下未知类别发现,对复杂图像更鲁棒。
广义类别发现(GCD)旨在部分标注的数据集中将未标注图像分类至已知和新类别,且无需事先知道未知类别的数量。传统方法常依赖预设类别数等刚性假设,难以应对真实数据的多样性与复杂性。为此,本文提出AdaGCD,一种以聚类为中心的对比学习框架,引入自适应槽注意力(AdaSlot),根据数据复杂度动态确定最优槽数,消除预设槽数的需求。该机制通过动态分配表征能力,灵活将未标注数据聚类至已知与新类别。结合自适应表征与动态槽分配,方法同时捕捉实例特异性与空间聚集特征,提升开放世界中的类别发现性能。在多个公开及细粒度数据集上的实验验证了框架有效性,强调利用空间局部信息对未标注图像类别发现的重要性。
原文摘要 · Abstract (English)
Generalized Category Discovery (GCD) tackles the challenging problem of categorizing unlabeled images into both known and novel classes within a partially labeled dataset, without prior knowledge of the number of unknown categories. Traditional methods often rely on rigid assumptions, such as predefining the number of classes, which limits their ability to handle the inherent variability and complexity of real-world data. To address these shortcomings, we propose AdaGCD, a cluster-centric contrastive learning framework that incorporates Adaptive Slot Attention (AdaSlot) into the GCD framework. AdaSlot dynamically determines the optimal number of slots based on data complexity, removing the need for predefined slot counts. This adaptive mechanism facilitates the flexible clustering of unlabeled data into known and novel categories by dynamically allocating representational capacity. By integrating adaptive representation with dynamic slot allocation, our method captures both instance-specific and spatially clustered features, improving class discovery in open-world scenarios. Extensive experiments on public and fine-grained datasets validate the effectiveness of our framework, emphasizing the advantages of leveraging spatial local information for category discovery in unlabeled image datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。