In this paper, a discriminator-free adversarial-based Unsupervised Domain Adaptation (UDA) for Multi-Label Image Classification (MLIC) referred to as DDA-MLIC is proposed. Over the last two years, some attempts have been made for introducing adversarial-based UDA methods in the context of MLIC. However, these methods which rely on an additional discriminator subnet present two shortcomings. First, the learning of domain-invariant features may harm their task-specific discriminative power, since the classification and discrimination tasks are decoupled. Moreover, the use of an additional discriminator usually induces an increase of the network size. Herein, we propose to overcome these issues by introducing a novel adversarial critic that is directly deduced from the task-specific classifier. Specifically, a two-component Gaussian Mixture Model (GMM) is fitted on the source and target predictions, allowing the distinction of two clusters. This allows extracting a Gaussian distribution for each component. The resulting Gaussian distributions are then used for formulating an adversarial loss based on a Frechet distance. The proposed method is evaluated on three multi-label image datasets. The obtained results demonstrate that DDA-MLIC outperforms existing state-of-the-art methods while requiring a lower number of parameters.
翻译:在本文中,提议对多标签图像分类(DDA-MLIC)采用无歧视的对抗性、不受监督的域名调整(UDA),称为DDA-MLIC(MLIC),在过去两年中,有人试图在MLIC范围内采用基于对抗性的UDA方法,但是,这些依靠另外一种歧视者子网的方法存在两个缺点。首先,了解域性差异性特征可能会损害其任务特有的歧视能力,因为分类和歧视任务被拆分。此外,使用另外一种歧视者通常导致网络规模的扩大。我们提议通过引入一个新的对抗性评论家来克服这些问题,这种评论家可直接从任务分类者那里推导出。具体地说,一个两个组成部分的Gausian Mixture模型(GMMM)安装在源和目标预测上,可以区分两个组。这样就可以为每个部分提取一个高尔斯分布。随后产生的高尔斯分布用于根据Frechet参数制定对抗性损失的对抗性损失。我们提议的方法是用Frechet-LISM 演示现有数字的低位方法。