A Weight-aware-based Multi-source Unsupervised Domain Adaptation Method for Human Motion Intention Recognition

• URL: http://arxiv.org/abs/2404.15366v1
• Date: Fri, 19 Apr 2024 03:49:54 GMT
• Title: A Weight-aware-based Multi-source Unsupervised Domain Adaptation Method for Human Motion Intention Recognition
• Authors: Xiao-Yin Liu, Guotao Li, Xiao-Hu Zhou, Xu Liang, Zeng-Guang Hou,
• Abstract summary: unsupervised domain adaptation (UDA) method has become an effective way to this problem. The labeled data are collected from multiple source subjects that might be different not only from the target subject but also from each other. This paper develops a novel theory and algorithm for UDA to recognize HMI, where the margin disparity discrepancy (MDD) is extended to multi-source UDA theory. The developed multi-source UDA theory is theoretical and the generalization error on target subject is guaranteed.
• Score: 11.78805948637625
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate recognition of human motion intention (HMI) is beneficial for exoskeleton robots to improve the wearing comfort level and achieve natural human-robot interaction. A classifier trained on labeled source subjects (domains) performs poorly on unlabeled target subject since the difference in individual motor characteristics. The unsupervised domain adaptation (UDA) method has become an effective way to this problem. However, the labeled data are collected from multiple source subjects that might be different not only from the target subject but also from each other. The current UDA methods for HMI recognition ignore the difference between each source subject, which reduces the classification accuracy. Therefore, this paper considers the differences between source subjects and develops a novel theory and algorithm for UDA to recognize HMI, where the margin disparity discrepancy (MDD) is extended to multi-source UDA theory and a novel weight-aware-based multi-source UDA algorithm (WMDD) is proposed. The source domain weight, which can be adjusted adaptively by the MDD between each source subject and target subject, is incorporated into UDA to measure the differences between source subjects. The developed multi-source UDA theory is theoretical and the generalization error on target subject is guaranteed. The theory can be transformed into an optimization problem for UDA, successfully bridging the gap between theory and algorithm. Moreover, a lightweight network is employed to guarantee the real-time of classification and the adversarial learning between feature generator and ensemble classifiers is utilized to further improve the generalization ability. The extensive experiments verify theoretical analysis and show that WMDD outperforms previous UDA methods on HMI recognition tasks.

Related papers

• Adversarial Reweighting with $α$-Power Maximization for Domain Adaptation [56.859005008344276]
  We propose a novel approach, dubbed Adversarial Reweighting with $alpha$-Power Maximization (ARPM) In ARPM, we propose a novel adversarial reweighting model that adversarially learns to reweight source domain data to identify source-private class samples. We show that our method is superior to recent PDA methods.
  arXiv  Detail & Related papers  (2024-04-26T09:29:55Z)
• Subject-Based Domain Adaptation for Facial Expression Recognition [51.10374151948157]
  Adapting a deep learning model to a specific target individual is a challenging facial expression recognition task. This paper introduces a new MSDA method for subject-based domain adaptation in FER. It efficiently leverages information from multiple source subjects to adapt a deep FER model to a single target individual.
  arXiv  Detail & Related papers  (2023-12-09T18:40:37Z)
• Multi-source domain adaptation for regression [2.8648412780872845]
  Multi-source domain adaptation (DA) aims at leveraging information from more than one source domain to make predictions in a target domain. We extend a flexible single-source DA algorithm for classification through outcome-coarsening to enable its application to regression problems. We then augment our single-source DA algorithm for regression with ensemble learning to achieve multi-source DA.
  arXiv  Detail & Related papers  (2023-12-09T04:09:37Z)
• Source-Free Domain Adaptation for Medical Image Segmentation via Prototype-Anchored Feature Alignment and Contrastive Learning [57.43322536718131]
  We present a two-stage source-free domain adaptation (SFDA) framework for medical image segmentation. In the prototype-anchored feature alignment stage, we first utilize the weights of the pre-trained pixel-wise classifier as source prototypes. Then, we introduce the bi-directional transport to align the target features with class prototypes by minimizing its expected cost.
  arXiv  Detail & Related papers  (2023-07-19T06:07:12Z)
• Source-free Domain Adaptation Requires Penalized Diversity [60.04618512479438]
  Source-free domain adaptation (SFDA) was introduced to address knowledge transfer between different domains in the absence of source data. In unsupervised SFDA, the diversity is limited to learning a single hypothesis on the source or learning multiple hypotheses with a shared feature extractor. We propose a novel unsupervised SFDA algorithm that promotes representational diversity through the use of separate feature extractors.
  arXiv  Detail & Related papers  (2023-04-06T00:20:19Z)
• Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptation [7.6249291891777915]
  We use information-theoretic tools to derive a novel analysis of Multi-source Domain Adaptation (MDA) from the representation learning perspective. We propose a novel deep MDA algorithm, implicitly addressing the target shift through joint alignment. The proposed algorithm has comparable performance to the state-of-the-art on target-shifted MDA benchmark with improved memory efficiency.
  arXiv  Detail & Related papers  (2023-04-04T18:32:20Z)
• IM-IAD: Industrial Image Anomaly Detection Benchmark in Manufacturing [88.35145788575348]
  Image anomaly detection (IAD) is an emerging and vital computer vision task in industrial manufacturing. The lack of a uniform IM benchmark is hindering the development and usage of IAD methods in real-world applications. We construct a comprehensive image anomaly detection benchmark (IM-IAD), which includes 19 algorithms on seven major datasets.
  arXiv  Detail & Related papers  (2023-01-31T01:24:45Z)
• IT-RUDA: Information Theory Assisted Robust Unsupervised Domain Adaptation [7.225445443960775]
  Distribution shift between train (source) and test (target) datasets is a common problem encountered in machine learning applications. UDA technique carries out knowledge transfer from a label-rich source domain to an unlabeled target domain. Outliers that exist in either source or target datasets can introduce additional challenges when using UDA in practice.
  arXiv  Detail & Related papers  (2022-10-24T04:33:52Z)
• Multi-Source Unsupervised Domain Adaptation via Pseudo Target Domain [0.0]
  Multi-source domain adaptation (MDA) aims to transfer knowledge from multiple source domains to an unlabeled target domain. We propose a novel MDA approach, termed Pseudo Target for MDA (PTMDA) PTMDA maps each group of source and target domains into a group-specific subspace using adversarial learning with a metric constraint. We show that PTMDA as a whole can reduce the target error bound and leads to a better approximation of the target risk in MDA settings.
  arXiv  Detail & Related papers  (2022-02-22T08:37:16Z)
• UMAD: Universal Model Adaptation under Domain and Category Shift [138.12678159620248]
  Universal Model ADaptation (UMAD) framework handles both UDA scenarios without access to source data. We develop an informative consistency score to help distinguish unknown samples from known samples. Experiments on open-set and open-partial-set UDA scenarios demonstrate that UMAD exhibits comparable, if not superior, performance to state-of-the-art data-dependent methods.
  arXiv  Detail & Related papers  (2021-12-16T01:22:59Z)
• Knothe-Rosenblatt transport for Unsupervised Domain Adaptation [8.945289838882857]
  Unsupervised domain adaptation (UDA) aims at exploiting related but different data sources to tackle a common task in a target domain. We present Knothe-Rosenblatt Domain Adaptation (KRDA) based on the Knothe-Rosenblatt transport. We show that KRDA has state-of-the-art performance on both synthetic and real world UDA problems.
  arXiv  Detail & Related papers  (2021-10-06T13:04:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.