4.7 Article

Probability-Based Graph Embedding Cross-Domain and Class Discriminative Feature Learning for Domain Adaptation

期刊

IEEE TRANSACTIONS ON IMAGE PROCESSING
卷 32, 期 -, 页码 72-87

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2022.3226405

关键词

Graph embedding; class discriminative feature learning; cross-domain alignment; probability information; unsupervised domain adaptation

向作者/读者索取更多资源

Feature-based domain adaptation methods aim to align the distribution of samples from different domains by projecting them into the same feature space, in order to learn a transferable model. The challenge lies in reducing the domain shift and improving the discriminability of features. To address these issues, we propose a unified Probability-based Graph embedding Cross-domain and class Discriminative feature learning framework (PGCD) for unsupervised domain adaptation. We introduce novel graph embedding structures as class discriminative transfer feature learning items and cross-domain alignment items, which compact same-category samples within each domain and align the local and global geometric structures across domains. The proposed model demonstrates promising performance on benchmark datasets compared to advanced approaches, validating its effectiveness.
Feature-based domain adaptation methods project samples from different domains into the same feature space and try to align the distribution of two domains to learn an effective transferable model. The vital problem is how to find a proper way to reduce the domain shift and improve the discriminability of features. To address the above issues, we propose a unified Probability-based Graph embedding Cross-domain and class Discriminative feature learning framework for unsupervised domain adaptation (PGCD). Specifically, we propose novel graph embedding structures to be the class discriminative transfer feature learning item and cross-domain alignment item, which can make the same-category samples compact in each domain, and fully align the local and global geometric structure across domains. Besides, two theoretical analyses are given to prove the interpretability of the proposed graph structures, which can further describe the relationships between samples to samples in single-domain and cross-domain transfer feature learning scenarios. Moreover, we adopt novel weight strategies via probability information to generate robust centroids in each proposed item to enhance the accuracy of transfer feature learning and reduce the error accumulation. Compared with the advanced approaches by comprehensive experiments, the promising performance on the benchmark datasets verify the effectiveness of the proposed model.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据