arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.06567cs.CV
收藏

开放集领域自适应中的类别无关聚类研究

Exploring Category-Agnostic Clusters for Open-Set Domain Adaptation

JD AI Research(京东人工智能研究院);City University of Hong Kong(香港城市大学)

Yingwei Pan, Ting Yao, Yehao Li, Chong-Wah Ngo, Tao Mei

摘要:

无监督领域自适应近年来受到了广泛的关注。大多数现有的作品处理闭集场景,假设源和目标域共享完全相同的类别。然而,在实践中,目标域通常包含在源域中看不见的类的样本(即,未知类)。领域自适应从闭集到这种开集情形的扩展并不是微不足道的,因为不期望未知类中的目标样本与源对齐。在本文中,我们解决这个问题,通过增加国家的最先进的领域自适应技术,自集成,与类别不可知的集群在目标域。具体来说,我们提出了自集成与类别不可知的集群(SE-CC)-一种新的架构,引导领域自适应与特定于目标域的类别不可知的集群的额外指导。这些聚类信息提供了特定领域的视觉线索,促进了闭集和开集场景的自集成的推广。从技术上讲,首先对所有未标记的目标样本进行聚类,以获得类别不可知的聚类,这些聚类揭示了目标领域特有的底层数据空间结构。利用聚类分支来确保学习的表示通过将聚类上的估计分配分布与每个目标样本的固有聚类分布相匹配来保留这种底层结构。此外,SE-CC增强了互信息最大化的学习表示。在Office和VisDA数据集上进行了开集和闭集领域自适应的广泛实验,并报告了与最先进方法相比的优越结果。

英文摘要:

Unsupervised domain adaptation has received significant attention in recent years. Most of existing works tackle the closed-set scenario, assuming that the source and target domains share the exactly same categories. In practice, nevertheless, a target domain often contains samples of classes unseen in source domain (i.e., unknown class). The extension of domain adaptation from closed-set to such open-set situation is not trivial since the target samples in unknown class are not expected to align with the source. In this paper, we address this problem by augmenting the state-of-the-art domain adaptation technique, Self-Ensembling, with category-agnostic clusters in target domain. Specifically, we present Self-Ensembling with Category-agnostic Clusters (SE-CC) -- a novel architecture that steers domain adaptation with the additional guidance of category-agnostic clusters that are specific to target domain. These clustering information provides domain-specific visual cues, facilitating the generalization of Self-Ensembling for both closed-set and open-set scenarios. Technically, clustering is firstly performed over all the unlabeled target samples to obtain the category-agnostic clusters, which reveal the underlying data space structure peculiar to target domain. A clustering branch is capitalized on to ensure that the learnt representation preserves such underlying structure by matching the estimated assignment distribution over clusters to the inherent cluster distribution for each target sample. Furthermore, SE-CC enhances the learnt representation with mutual information maximization. Extensive experiments are conducted on Office and VisDA datasets for both open-set and closed-set domain adaptation, and superior results are reported when comparing to the state-of-the-art approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑