资源论文Landmarks-based Kernelized Subspace Alignment for Unsupervised Domain Adaptation

Landmarks-based Kernelized Subspace Alignment for Unsupervised Domain Adaptation

2019-12-17 | |  80 |   37 |   0

Abstract

Domain adaptation (DA) has gained a lot of success in the recent years in computer vision to deal with situations where the learning process has to transfer knowledge from a source to a target domain. In this paper, we introduce a novel unsupervised DA approach based on both subspace alignment and selection of landmarks similarly distributed between the two domains. Those landmarks are selected so as to reduce the discrepancy between the domains and then are used to non linearly project the data in the same space where an effificient subspace alignment (in closed-form) is performed. We carry out a large experimental comparison in visual domain adaptation showing that our new method outperforms the most recent unsupervised DA approaches

上一篇:TILDE: A Temporally Invariant Learned DEtector

下一篇:Elastic-Net Regularization of Singular Values for Robust Subspace Learning

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...