SADA: Semantic adversarial unsupervised domain adaptation for Temporal Action Localization

• URL: http://arxiv.org/abs/2312.13377v3
• Date: Mon, 25 Nov 2024 12:38:52 GMT
• Title: SADA: Semantic adversarial unsupervised domain adaptation for Temporal Action Localization
• Authors: David Pujol-Perich, Albert Clapés, Sergio Escalera,
• Abstract summary: We introduce, for the first time, an approach for Unsupervised Domain Adaptation in sparse TAL. We pioneer the development of a domain adaptation model that operates on realistic sparse action detection benchmarks. We present a novel set of benchmarks based on EpicKitchens100 and CharadesEgo, that evaluate multiple domain shifts.
• Score: 32.35611853688068
• License:
• Abstract: Temporal Action Localization (TAL) is a complex task that poses relevant challenges, particularly when attempting to generalize on new -- unseen -- domains in real-world applications. These scenarios, despite realistic, are often neglected in the literature, exposing these solutions to important performance degradation. In this work, we tackle this issue by introducing, for the first time, an approach for Unsupervised Domain Adaptation (UDA) in sparse TAL, which we refer to as Semantic Adversarial unsupervised Domain Adaptation (SADA). Our contributions are threefold: (1) we pioneer the development of a domain adaptation model that operates on realistic sparse action detection benchmarks; (2) we tackle the limitations of global-distribution alignment techniques by introducing a novel adversarial loss that is sensitive to local class distributions, ensuring finer-grained adaptation; and (3) we present a novel set of benchmarks based on EpicKitchens100 and CharadesEgo, that evaluate multiple domain shifts in a comprehensive manner. Our experiments indicate that SADA improves the adaptation across domains when compared to fully supervised state-of-the-art and alternative UDA methods, attaining a performance boost of up to 6.14% mAP.

Related papers

• Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts [56.57141696245328]
  In open-world scenarios, where both novel classes and domains may exist, an ideal segmentation model should detect anomaly classes for safety. Existing methods often struggle to distinguish between domain-level and semantic-level distribution shifts.
  arXiv  Detail & Related papers  (2024-11-06T11:03:02Z)
• Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning [4.921899151930171]
  Unsupervised continual domain shift learning is a significant challenge in real-world applications. We propose Complementary Domain Adaptation and Generalization (CoDAG), a simple yet effective learning framework. Our approach is model-agnostic, meaning that it is compatible with any existing domain adaptation and generalization algorithms.
  arXiv  Detail & Related papers  (2023-03-28T09:05:15Z)
• Localized Adversarial Domain Generalization [83.4195658745378]
  Adversarial domain generalization is a popular approach to domain generalization. We propose localized adversarial domain generalization with space compactness maintenance(LADG) We conduct comprehensive experiments on the Wilds DG benchmark to validate our approach.
  arXiv  Detail & Related papers  (2022-05-09T08:30:31Z)
• Unsupervised Domain Generalization for Person Re-identification: A Domain-specific Adaptive Framework [50.88463458896428]
  Domain generalization (DG) has attracted much attention in person re-identification (ReID) recently. Existing methods usually need the source domains to be labeled, which could be a significant burden for practical ReID tasks. We propose a simple and efficient domain-specific adaptive framework, and realize it with an adaptive normalization module.
  arXiv  Detail & Related papers  (2021-11-30T02:35:51Z)
• Exploiting Diverse Characteristics and Adversarial Ambivalence for Domain Adaptive Segmentation [20.13548631627542]
  Adapting semantic segmentation models to new domains is an important but challenging problem. We propose a condition-guided adaptation framework that is empowered by a special progressive adversarial training mechanism and a novel self-training policy. We evaluate our method on various adaptation scenarios where the target images vary in weather conditions.
  arXiv  Detail & Related papers  (2020-12-10T11:50:59Z)
• Domain Adaptation with Incomplete Target Domains [61.68950959231601]
  We propose an Incomplete Data Imputation based Adversarial Network (IDIAN) model to address this new domain adaptation challenge. In the proposed model, we design a data imputation module to fill the missing feature values based on the partial observations in the target domain. We conduct experiments on both cross-domain benchmark tasks and a real world adaptation task with imperfect target domains.
  arXiv  Detail & Related papers  (2020-12-03T00:07:40Z)
• Unsupervised Domain Adaptation for Spatio-Temporal Action Localization [69.12982544509427]
  S-temporal action localization is an important problem in computer vision. We propose an end-to-end unsupervised domain adaptation algorithm. We show that significant performance gain can be achieved when spatial and temporal features are adapted separately or jointly.
  arXiv  Detail & Related papers  (2020-10-19T04:25:10Z)
• Learning Invariant Representations and Risks for Semi-supervised Domain Adaptation [109.73983088432364]
  We propose the first method that aims to simultaneously learn invariant representations and risks under the setting of semi-supervised domain adaptation (Semi-DA) We introduce the LIRR algorithm for jointly textbfLearning textbfInvariant textbfRepresentations and textbfRisks.
  arXiv  Detail & Related papers  (2020-10-09T15:42:35Z)
• Generalized Zero-Shot Domain Adaptation via Coupled Conditional Variational Autoencoders [23.18781318003242]
  We present a novel Conditional Coupled Variational Autoencoder (CCVAE) which can generate synthetic target domain features for unseen classes from their source domain counterparts. Experiments have been conducted on three domain adaptation datasets including a bespoke X-ray security checkpoint dataset to simulate a real-world application in aviation security.
  arXiv  Detail & Related papers  (2020-08-03T21:48:50Z)
• Attract, Perturb, and Explore: Learning a Feature Alignment Network for Semi-supervised Domain Adaptation [34.81203184926791]
  We study the novel setting of the semi-supervised domain adaptation (SSDA) problem. Our framework consists of three schemes, i.e., attraction, perturbation, and exploration. Our method achieves state-of-the-art performances on all datasets.
  arXiv  Detail & Related papers  (2020-07-18T09:26:25Z)

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.