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 条
  • [31] Feature Space Independent Semi-Supervised Domain Adaptation via Kernel Matching
    Xiao, Min
    Guo, Yuhong
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (01) : 54 - 66
  • [32] Towards Universal Object Detection by Domain Attention
    Wang, Xudong
    Cai, Zhaowei
    Gao, Dashan
    Vasconcelos, Nuno
    2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 7281 - 7290
  • [33] Compressive Symbol Detection via Template Matching
    Park, Jae-Hyuck
    Kim, Yookyung
    Kim, Seonghyun
    2017 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC), 2017, : 1171 - 1174
  • [34] Divergence Optimization for Noisy Universal Domain Adaptation
    Yu, Qing
    Hashimoto, Atsushi
    Ushiku, Yoshitaka
    2021 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, CVPR 2021, 2021, : 2515 - 2524
  • [35] Universal Source-Free Domain Adaptation
    Kundu, Jogendra Nath
    Venkat, Naveen
    Rahul, M., V
    Babu, R. Venkatesh
    2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, : 4543 - 4552
  • [36] Prediction of common labels for universal domain adaptation
    Shan, Xinxin
    Ma, Tai
    Wen, Ying
    NEURAL NETWORKS, 2023, 165 : 463 - 471
  • [37] Subsidiary Prototype Alignment for Universal Domain Adaptation
    Kundu, Jogendra Nath
    Bhambri, Suvaansh
    Kulkarni, Akshay
    Sarkar, Hiran
    Jampani, Varun
    Babu, R. Venkatesh
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [38] Unsupervised Domain Adaptation with Distribution Matching Machines
    Cao, Yue
    Long, Mingsheng
    Wang, Jianmin
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 2795 - 2802
  • [39] Discriminative Joint Matching for Unsupervised Domain Adaptation
    Zhang Y.
    Xia T.
    Huang D.
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2021, 34 (10): : 932 - 940
  • [40] Distribution matching and structure preservation for domain adaptation
    Ping Li
    Zhiwei Ni
    Xuhui Zhu
    Juan Song
    Complex & Intelligent Systems, 2023, 9 : 1823 - 1835