...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >Sparsely-lab ele d source assisted domain adaptation
【24h】

Sparsely-lab ele d source assisted domain adaptation

机译:稀疏 - 实验室ELE D源辅助域适应

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Domain Adaptation (DA) aims to generalize the classifier learned from a well-labeled source domain to an unlabeled target domain. Existing DA methods usually assume that rich labels could be available in the source domain. However, we usually confront the source domain with a large number of unlabeled data but only a few labeled data, and thus, how to transfer knowledge from this sparsely-labeled source domain to the target domain is still a challenge, which greatly limits its application in the wild. This paper proposes a novel Sparsely-Labeled Source Assisted Domain Adaptation (SLSA-DA) algorithm to address the challenge with limited labeled source domain samples. Specifically, due to the label scarcity problem, the projected clustering is first conducted on both the source and target domains, so that the discriminative structures of data could be exploited elegantly. Then label propagation is adopted to propagate the labels from those limited labeled source samples to the whole unlabeled data progressively, so that the cluster labels are revealed correctly. Finally, we jointly align the marginal and conditional distributions to mitigate the cross-domain mismatching problem, and optimize those three procedures iteratively. However, it is nontrivial to incorporate the above three procedures into a unified optimization framework seamlessly since some variables to be optimized are implicitly involved in their formulas, thus they could not benefit to each other. Remarkably, we prove that the projected clustering and conditional distribution alignment could be reformulated into other formulations, thus the implicit variables are embedded in different optimization steps. As such, the variables related to those three quantities could be optimized in a unified optimization framework and benefit to each other, and improve the recognition performance obviously. Extensive experiments have verified that our approach could deal with the challenge in the SLSA-DA setting, and achieve the best performances across different real-world cross-domain visual recognition tasks. Our preliminary Matlab code is available at https://github.com/WWLoveTransfer/SLSA-DA/ . (c) 2021 Elsevier Ltd. All rights reserved.
机译:域自适应(DA)的目的是将从标记良好的源域学习的分类器推广到未标记的目标域。现有的DA方法通常假定在源域中可以使用丰富的标签。然而,我们通常面对的源领域有大量未标记的数据,但只有少数标记的数据,因此,如何将知识从这个标记稀疏的源领域转移到目标领域仍然是一个挑战,这极大地限制了它在野外的应用。本文提出了一种新的稀疏标记源辅助域自适应(SLSA-DA)算法,以解决标记源域样本有限的问题。具体来说,由于标签稀缺问题,首先在源域和目标域上进行预测聚类,以便优雅地利用数据的区分结构。然后采用标签传播的方法,将有限的标签源样本中的标签逐步传播到整个未标记数据中,从而正确地显示聚类标签。最后,我们联合调整边际分布和条件分布,以缓解跨域不匹配问题,并迭代优化这三个过程。然而,将上述三个过程无缝地结合到一个统一的优化框架中是不寻常的,因为一些需要优化的变量隐含在它们的公式中,因此它们不能相互受益。值得注意的是,我们证明了投影聚类和条件分布对齐可以重新表述为其他公式,因此隐式变量嵌入到不同的优化步骤中。因此,与这三个量相关的变量可以在一个统一的优化框架内进行优化,并相互受益,显著提高识别性能。大量实验证明,我们的方法能够在SLSA-DA环境下应对这一挑战,并在不同的实际跨域视觉识别任务中获得最佳性能。我们的初步Matlab代码可在https://github.com/WWLoveTransfer/SLSA-DA/(c)2021爱思唯尔有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号