Universal Domain Adaptation via Compressive Attention Matching

被引:5
|
作者
Zhu, Didi [1 ]
Li, Yinchuan [2 ]
Yuan, Junkun [1 ]
Li, Zexi [1 ]
Kuang, Kun [1 ]
Wu, Chao [1 ]
机构
[1] Zhejiang Univ, Hangzhou, Peoples R China
[2] Huawei Noahs Ark Lab, Montreal, PQ, Canada
基金
中国国家自然科学基金;
关键词
D O I
10.1109/ICCV51070.2023.00642
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Universal domain adaptation (UniDA) aims to transfer knowledge from the source domain to the target domain without any prior knowledge about the label set. The challenge lies in how to determine whether the target samples belong to common categories. The mainstream methods make judgments based on the sample features, which overemphasizes global information while ignoring the most crucial local objects in the image, resulting in limited accuracy. To address this issue, we propose a Universal Attention Matching (UniAM) framework by exploiting the self-attention mechanism in vision transformer to capture the crucial object information. The proposed framework introduces a novel Compressive Attention Matching (CAM) approach to explore the core information by compressively representing attentions. Furthermore, CAM incorporates a residual-based measurement to determine the sample commonness. By utilizing the measurement, UniAM achieves domain-wise and category-wise Common Feature Alignment (CFA) and Target Class Separation (TCS). Notably, UniAM is the first method utilizing the attention in vision transformer directly to perform classification tasks. Extensive experiments show that UniAM outperforms the current state-of-the-art methods on various benchmark datasets.
引用
收藏
页码:6951 / 6962
页数:12
相关论文
共 50 条
  • [41] Transfer Joint Matching for Unsupervised Domain Adaptation
    Long, Mingsheng
    Wang, Jianmin
    Ding, Guiguang
    Sun, Jiaguang
    Yu, Philip S.
    2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, : 1410 - 1417
  • [42] Bayesian Uncertainty Matching for Unsupervised Domain Adaptation
    Wen, Jun
    Zheng, Nenggan
    Yuan, Junsong
    Gong, Zhefeng
    Chen, Changyou
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 3849 - 3855
  • [43] Distribution matching and structure preservation for domain adaptation
    Li, Ping
    Ni, Zhiwei
    Zhu, Xuhui
    Song, Juan
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (02) : 1823 - 1835
  • [44] LAMDA: Label Matching Deep Domain Adaptation
    Trung Le
    Tuan Nguyen
    Nhat Ho
    Hung Bui
    Dinh Phung
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [45] Maximum open-set entropy optimization via uncertainty measure for universal domain adaptation
    Ai, Weiwei
    Yang, Zhao
    Chen, Zhiyong
    Hu, Xiao
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2024, 101
  • [46] Open Set Domain Recognition via Attention-Based GCN and Semantic Matching Optimization
    He, Xinxing
    Yuan, Yuan
    Jiang, Zhiyu
    2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2021, : 4626 - 4633
  • [47] Attention-Bridging TS Fuzzy Rules for Universal Multi-Domain Adaptation without Source Data
    Li, Keqiuyin
    Lu, Jie
    Zuo, Hua
    Zhang, Guangquan
    2023 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, FUZZ, 2023,
  • [48] Attention Regularized Laplace Graph for Domain Adaptation
    Luo, Lingkun
    Chen, Liming
    Hu, Shiqiang
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2022, 31 : 7322 - 7337
  • [49] Unsupervised Domain Adaptation by Matching Distributions Based on the Maximum Mean Discrepancy via Unilateral Transformations
    Kumagai, Atsutoshi
    Iwata, Tomoharu
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 4106 - 4113
  • [50] Transferable attention networks for adversarial domain adaptation
    Zhang, Changchun
    Zhao, Qingjie
    Wang, Yu
    INFORMATION SCIENCES, 2020, 539 : 422 - 433