Divide, Ensemble and Conquer: The Last Mile on Unsupervised Domain Adaptation for On-Board Semantic Segmentation

• URL: http://arxiv.org/abs/2406.18809v1
• Date: Thu, 27 Jun 2024 00:54:11 GMT
• Title: Divide, Ensemble and Conquer: The Last Mile on Unsupervised Domain Adaptation for On-Board Semantic Segmentation
• Authors: Tao Lian, Jose L. Gómez, Antonio M. López,
• Abstract summary: We propose DEC, a flexible UDA framework for multi-source datasets. Following a divide-and-conquer strategy, DEC simplifies the task by categorizing semantic classes, training models for each category, and fusing their outputs by an ensemble model trained exclusively on synthetic datasets to obtain the final segmentation mask. DEC can integrate with existing UDA methods, achieving state-of-the-art performance on Cityscapes, BDD100K, and Mapillary Vistas.
• Score: 7.658092990342648
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The last mile of unsupervised domain adaptation (UDA) for semantic segmentation is the challenge of solving the syn-to-real domain gap. Recent UDA methods have progressed significantly, yet they often rely on strategies customized for synthetic single-source datasets (e.g., GTA5), which limits their generalisation to multi-source datasets. Conversely, synthetic multi-source datasets hold promise for advancing the last mile of UDA but remain underutilized in current research. Thus, we propose DEC, a flexible UDA framework for multi-source datasets. Following a divide-and-conquer strategy, DEC simplifies the task by categorizing semantic classes, training models for each category, and fusing their outputs by an ensemble model trained exclusively on synthetic datasets to obtain the final segmentation mask. DEC can integrate with existing UDA methods, achieving state-of-the-art performance on Cityscapes, BDD100K, and Mapillary Vistas, significantly narrowing the syn-to-real domain gap.

Related papers

• MICDrop: Masking Image and Depth Features via Complementary Dropout for Domain-Adaptive Semantic Segmentation [155.0797148367653]
  Unsupervised Domain Adaptation (UDA) is the task of bridging the domain gap between a labeled source domain and an unlabeled target domain. We propose to leverage geometric information, i.e., depth predictions, as depth discontinuities often coincide with segmentation boundaries. We show that our method can be plugged into various recent UDA methods and consistently improve results across standard UDA benchmarks.
  arXiv  Detail & Related papers  (2024-08-29T12:15:10Z)
• Multi-Target Unsupervised Domain Adaptation for Semantic Segmentation without External Data [25.386114973556406]
  Multi-target unsupervised domain adaptation (UDA) aims to learn a unified model to address the domain shift between multiple target domains. Most existing solutions require labeled data from the source domain and unlabeled data from multiple target domains concurrently during training. We introduce a new strategy called "multi-target UDA without external data" for semantic segmentation.
  arXiv  Detail & Related papers  (2024-05-10T14:29:51Z)
• CLUDA : Contrastive Learning in Unsupervised Domain Adaptation for Semantic Segmentation [3.4123736336071864]
  CLUDA is a simple, yet novel method for performing unsupervised domain adaptation (UDA) for semantic segmentation. We extract a multi-level fused-feature map from the encoder, and apply contrastive loss across different classes and different domains. We produce state-of-the-art results on GTA $rightarrow$ Cityscapes (74.4 mIOU, +0.6) and Synthia $rightarrow$ Cityscapes (67.2 mIOU, +1.4) datasets.
  arXiv  Detail & Related papers  (2022-08-27T05:13:14Z)
• Discover, Hallucinate, and Adapt: Open Compound Domain Adaptation for Semantic Segmentation [91.30558794056056]
  Unsupervised domain adaptation (UDA) for semantic segmentation has been attracting attention recently. We present a novel framework based on three main design principles: discover, hallucinate, and adapt. We evaluate our solution on standard benchmark GTA to C-driving, and achieved new state-of-the-art results.
  arXiv  Detail & Related papers  (2021-10-08T13:20:09Z)
• Inferring Latent Domains for Unsupervised Deep Domain Adaptation [54.963823285456925]
  Unsupervised Domain Adaptation (UDA) refers to the problem of learning a model in a target domain where labeled data are not available. This paper introduces a novel deep architecture which addresses the problem of UDA by automatically discovering latent domains in visual datasets. We evaluate our approach on publicly available benchmarks, showing that it outperforms state-of-the-art domain adaptation methods.
  arXiv  Detail & Related papers  (2021-03-25T14:33:33Z)
• Multi-Source Domain Adaptation with Collaborative Learning for Semantic Segmentation [32.95273803359897]
  Multi-source unsupervised domain adaptation(MSDA) aims at adapting models trained on multiple labeled source domains to an unlabeled target domain. We propose a novel multi-source domain adaptation framework based on collaborative learning for semantic segmentation.
  arXiv  Detail & Related papers  (2021-03-08T12:51:42Z)
• Cluster, Split, Fuse, and Update: Meta-Learning for Open Compound Domain Adaptive Semantic Segmentation [102.42638795864178]
  We propose a principled meta-learning based approach to OCDA for semantic segmentation. We cluster target domain into multiple sub-target domains by image styles, extracted in an unsupervised manner. A meta-learner is thereafter deployed to learn to fuse sub-target domain-specific predictions, conditioned upon the style code. We learn to online update the model by model-agnostic meta-learning (MAML) algorithm, thus to further improve generalization.
  arXiv  Detail & Related papers  (2020-12-15T13:21:54Z)
• Continual Unsupervised Domain Adaptation for Semantic Segmentation [14.160280479726921]
  Unsupervised Domain Adaptation (UDA) for semantic segmentation has been favorably applied to real-world scenarios in which pixel-level labels are hard to be obtained. We propose Continual UDA for semantic segmentation based on a newly designed Expanding Target-specific Memory (ETM) framework. Our novel ETM framework contains Target-specific Memory (TM) for each target domain to alleviate catastrophic forgetting.
  arXiv  Detail & Related papers  (2020-10-19T05:59:48Z)
• Multi-source Domain Adaptation in the Deep Learning Era: A Systematic Survey [53.656086832255944]
  Multi-source domain adaptation (MDA) is a powerful extension in which the labeled data may be collected from multiple sources. MDA has attracted increasing attention in both academia and industry.
  arXiv  Detail & Related papers  (2020-02-26T08:07:58Z)
• MADAN: Multi-source Adversarial Domain Aggregation Network for Domain Adaptation [58.38749495295393]
  Domain adaptation aims to learn a transferable model to bridge the domain shift between one labeled source domain and another sparsely labeled or unlabeled target domain. Recent multi-source domain adaptation (MDA) methods do not consider the pixel-level alignment between sources and target. We propose a novel MDA framework to address these challenges.
  arXiv  Detail & Related papers  (2020-02-19T21:22:00Z)

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.