Towards Robust Online Domain Adaptive Semantic Segmentation under Adverse Weather Conditions

• URL: http://arxiv.org/abs/2409.01072v1
• Date: Mon, 2 Sep 2024 08:53:08 GMT
• Title: Towards Robust Online Domain Adaptive Semantic Segmentation under Adverse Weather Conditions
• Authors: Taorong Liu, Jing Xiao, Liang Liao, Chia-Wen Lin,
• Abstract summary: We present textbfRODASS, a textbfRobust textbfOnline textbfDomain textbfAdaptive textbfSemantic textbfSegmentation framework. Our approach outperforms state-of-the-art methods on widely used OnDA benchmarks while maintaining approximately 40 frames per second (FPS)
• Score: 43.58583290714884
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Online Domain Adaptation (OnDA) is designed to handle unforeseeable domain changes at minimal cost that occur during the deployment of the model, lacking clear boundaries between the domain, such as sudden weather events. However, existing OnDA methods that rely solely on the model itself to adapt to the current domain often misidentify ambiguous classes amidst continuous domain shifts and pass on this erroneous knowledge to the next domain. To tackle this, we propose \textbf{RODASS}, a \textbf{R}obust \textbf{O}nline \textbf{D}omain \textbf{A}daptive \textbf{S}emantic \textbf{S}egmentation framework, which dynamically detects domain shifts and adjusts hyper-parameters to minimize training costs and error propagation. Specifically, we introduce the \textbf{D}ynamic \textbf{A}mbiguous \textbf{P}atch \textbf{Mask} (\textbf{DAP Mask}) strategy, which dynamically selects highly disturbed regions and masks these regions, mitigating error accumulation in ambiguous classes and enhancing the model's robustness against external noise in dynamic natural environments. Additionally, we present the \textbf{D}ynamic \textbf{S}ource \textbf{C}lass \textbf{Mix} (\textbf{DSC Mix}), a domain-aware mix method that augments target domain scenes with class-level source buffers, reducing the high uncertainty and noisy labels, thereby accelerating adaptation and offering a more efficient solution for online domain adaptation. Our approach outperforms state-of-the-art methods on widely used OnDA benchmarks while maintaining approximately 40 frames per second (FPS).

Related papers

• Noise Optimized Conditional Diffusion for Domain Adaptation [7.414646586981638]
  Pseudo-labeling is a cornerstone of Unsupervised Domain Adaptation (UDA)<n>We propose textbfNoise textbfOptimized textbfConditional textbfDiffusion for textbfDomain textbfAdaptation (textbfNOCDDA)
  arXiv  Detail & Related papers  (2025-05-12T13:28:31Z)
• Dynamic Prompt Allocation and Tuning for Continual Test-Time Adaptation [29.931721498877483]
  Continual test-time adaptation (CTTA) has recently emerged to adapt to continuously evolving target distributions.<n>Existing methods typically incorporate explicit regularization terms to constrain the variation of model parameters.<n>We introduce learnable domain-specific prompts that guide the model to adapt to corresponding target domains.
  arXiv  Detail & Related papers  (2024-12-12T14:24:04Z)
• SVasP: Self-Versatility Adversarial Style Perturbation for Cross-Domain Few-Shot Learning [21.588320570295835]
  Cross-Domain Few-Shot Learning aims to transfer knowledge from seen source domains to unseen target domains. Recent studies focus on utilizing visual styles to bridge the domain gap between different domains. This paper proposes a novel crop-global style method, called underlinetextbfSelf-underlinetextbfVersatility.
  arXiv  Detail & Related papers  (2024-12-12T08:58:42Z)
• Curvature Diversity-Driven Deformation and Domain Alignment for Point Cloud [28.713586981346808]
  Unsupervised Domain Adaptation (UDA) is crucial for reducing the need for extensive manual data annotation. We propose textbfCurvature textbfDiversity-Driven textbfNuclear-Norm Wasserstein textbfDomain Alignment (CDND) Our approach first introduces a textittextbfCurvature Diversity-driven Deformation textbfReconstruction (CurvRec) task. We then propose textittextbfD
  arXiv  Detail & Related papers  (2024-10-03T17:39:55Z)
• StyDeSty: Min-Max Stylization and Destylization for Single Domain Generalization [85.18995948334592]
  Single domain generalization (single DG) aims at learning a robust model generalizable to unseen domains from only one training domain. State-of-the-art approaches have mostly relied on data augmentations, such as adversarial perturbation and style enhancement, to synthesize new data. We propose emphStyDeSty, which explicitly accounts for the alignment of the source and pseudo domains in the process of data augmentation.
  arXiv  Detail & Related papers  (2024-06-01T02:41:34Z)
• Language-Guided Instance-Aware Domain-Adaptive Panoptic Segmentation [44.501770535446624]
  Key challenge in panoptic domain adaptation is reducing the domain gap between a labeled source and an unlabeled target domain. We focus on incorporating instance-level adaptation via a novel cross-domain mixing strategy IMix. We present an end-to-end model incorporating these two mechanisms called LIDAPS, achieving state-of-the-art results on all popular panoptic UDA benchmarks.
  arXiv  Detail & Related papers  (2024-04-04T20:42:49Z)
• GLAD: Global-Local View Alignment and Background Debiasing for Unsupervised Video Domain Adaptation with Large Domain Gap [9.284539958686368]
  We tackle the challenging problem of unsupervised video domain adaptation (UVDA) for action recognition. We introduce a novel UVDA scenario, denoted as Kinetics->BABEL, with a more considerable domain gap in terms of both temporal dynamics and background shifts. We empirically validate that the proposed method shows significant improvement over the existing methods on the Kinetics->BABEL dataset with a large domain gap.
  arXiv  Detail & Related papers  (2023-11-21T09:27:30Z)
• CDA: Contrastive-adversarial Domain Adaptation [11.354043674822451]
  We propose a two-stage model for domain adaptation called textbfContrastive-adversarial textbfDomain textbfAdaptation textbf(CDA). While the adversarial component facilitates domain-level alignment, two-stage contrastive learning exploits class information to achieve higher intra-class compactness across domains.
  arXiv  Detail & Related papers  (2023-01-10T07:43:21Z)
• Cyclically Disentangled Feature Translation for Face Anti-spoofing [61.70377630461084]
  We propose a novel domain adaptation method called cyclically disentangled feature translation network (CDFTN) CDFTN generates pseudo-labeled samples that possess: 1) source domain-invariant liveness features and 2) target domain-specific content features, which are disentangled through domain adversarial training. A robust classifier is trained based on the synthetic pseudo-labeled images under the supervision of source domain labels.
  arXiv  Detail & Related papers  (2022-12-07T14:12:34Z)
• Generative Domain Adaptation for Face Anti-Spoofing [38.12738183385737]
  Face anti-spoofing approaches based on unsupervised domain adaption (UDA) have drawn growing attention due to promising performances for target scenarios. Most existing UDA FAS methods typically fit the trained models to the target domain via aligning the distribution of semantic high-level features. We propose a novel perspective of UDA FAS that directly fits the target data to the models, stylizes the target data to the source-domain style via image translation, and further feeds the stylized data into the well-trained source model for classification.
  arXiv  Detail & Related papers  (2022-07-20T16:24:57Z)
• Stagewise Unsupervised Domain Adaptation with Adversarial Self-Training for Road Segmentation of Remote Sensing Images [93.50240389540252]
  Road segmentation from remote sensing images is a challenging task with wide ranges of application potentials. We propose a novel stagewise domain adaptation model called RoadDA to address the domain shift (DS) issue in this field. Experiment results on two benchmarks demonstrate that RoadDA can efficiently reduce the domain gap and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-08-28T09:29:14Z)
• Context-Aware Mixup for Domain Adaptive Semantic Segmentation [52.1935168534351]
  Unsupervised domain adaptation (UDA) aims to adapt a model of the labeled source domain to an unlabeled target domain. We propose end-to-end Context-Aware Mixup (CAMix) for domain adaptive semantic segmentation. Experimental results show that the proposed method outperforms the state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2021-08-08T03:00:22Z)
• AFAN: Augmented Feature Alignment Network for Cross-Domain Object Detection [90.18752912204778]
  Unsupervised domain adaptation for object detection is a challenging problem with many real-world applications. We propose a novel augmented feature alignment network (AFAN) which integrates intermediate domain image generation and domain-adversarial training. Our approach significantly outperforms the state-of-the-art methods on standard benchmarks for both similar and dissimilar domain adaptations.
  arXiv  Detail & Related papers  (2021-06-10T05:01:20Z)
• Generalizable Representation Learning for Mixture Domain Face Anti-Spoofing [53.82826073959756]
  Face anti-spoofing approach based on domain generalization(DG) has drawn growing attention due to its robustness forunseen scenarios. We propose domain dy-namic adjustment meta-learning (D2AM) without using do-main labels. To overcome the limitation, we propose domain dy-namic adjustment meta-learning (D2AM) without using do-main labels.
  arXiv  Detail & Related papers  (2021-05-06T06:04:59Z)
• Bilevel Online Adaptation for Out-of-Domain Human Mesh Reconstruction [94.25865526414717]
  This paper considers a new problem of adapting a pre-trained model of human mesh reconstruction to out-of-domain streaming videos. We propose Bilevel Online Adaptation, which divides the optimization process of overall multi-objective into two steps of weight probe and weight update in a training. We demonstrate that BOA leads to state-of-the-art results on two human mesh reconstruction benchmarks.
  arXiv  Detail & Related papers  (2021-03-30T15:47:58Z)
• Uncertainty-Aware Consistency Regularization for Cross-Domain Semantic Segmentation [63.75774438196315]
  Unsupervised domain adaptation (UDA) aims to adapt existing models of the source domain to a new target domain with only unlabeled data. Most existing methods suffer from noticeable negative transfer resulting from either the error-prone discriminator network or the unreasonable teacher model. We propose an uncertainty-aware consistency regularization method for cross-domain semantic segmentation.
  arXiv  Detail & Related papers  (2020-04-19T15:30:26Z)

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.