ADeADA: Adaptive Density-aware Active Domain Adaptation for Semantic Segmentation

• URL: http://arxiv.org/abs/2202.06484v2
• Date: Tue, 15 Feb 2022 02:36:38 GMT
• Title: ADeADA: Adaptive Density-aware Active Domain Adaptation for Semantic Segmentation
• Authors: Tsung-Han Wu, Yi-Syuan Liou, Shao-Ji Yuan, Hsin-Ying Lee, Tung-I Chen, Winston H. Hsu
• Abstract summary: We present ADeADA, a general active domain adaptation framework for semantic segmentation. With less than 5% target domain annotations, our method reaches comparable results with that of full supervision.
• Score: 23.813813896293876
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In the field of domain adaptation, a trade-off exists between the model performance and the number of target domain annotations. Active learning, maximizing model performance with few informative labeled data, comes in handy for such a scenario. In this work, we present ADeADA, a general active domain adaptation framework for semantic segmentation. To adapt the model to the target domain with minimum queried labels, we propose acquiring labels of the samples with high probability density in the target domain yet with low probability density in the source domain, complementary to the existing source domain labeled data. To further facilitate the label efficiency, we design an adaptive budget allocation policy, which dynamically balances the labeling budgets among different categories as well as between density-aware and uncertainty-based methods. Extensive experiments show that our method outperforms existing active learning and domain adaptation baselines on two benchmarks, GTA5 -> Cityscapes and SYNTHIA -> Cityscapes. With less than 5% target domain annotations, our method reaches comparable results with that of full supervision.

Related papers

• PiPa++: Towards Unification of Domain Adaptive Semantic Segmentation via Self-supervised Learning [34.786268652516355]
  Unsupervised domain adaptive segmentation aims to improve the segmentation accuracy of models on target domains without relying on labeled data from those domains. It seeks to align the feature representations of the source domain (where labeled data is available) and the target domain (where only unlabeled data is present)
  arXiv  Detail & Related papers  (2024-07-24T08:53:29Z)
• Inter-Domain Mixup for Semi-Supervised Domain Adaptation [108.40945109477886]
  Semi-supervised domain adaptation (SSDA) aims to bridge source and target domain distributions, with a small number of target labels available. Existing SSDA work fails to make full use of label information from both source and target domains for feature alignment across domains. This paper presents a novel SSDA approach, Inter-domain Mixup with Neighborhood Expansion (IDMNE), to tackle this issue.
  arXiv  Detail & Related papers  (2024-01-21T10:20:46Z)
• Divide and Adapt: Active Domain Adaptation via Customized Learning [56.79144758380419]
  We present Divide-and-Adapt (DiaNA), a new ADA framework that partitions the target instances into four categories with stratified transferable properties. With a novel data subdivision protocol based on uncertainty and domainness, DiaNA can accurately recognize the most gainful samples. Thanks to the "divideand-adapt" spirit, DiaNA can handle data with large variations of domain gap.
  arXiv  Detail & Related papers  (2023-07-21T14:37:17Z)
• Labeling Where Adapting Fails: Cross-Domain Semantic Segmentation with Point Supervision via Active Selection [81.703478548177]
  Training models dedicated to semantic segmentation require a large amount of pixel-wise annotated data. Unsupervised domain adaptation approaches aim at aligning the feature distributions between the labeled source and the unlabeled target data. Previous works attempted to include human interactions in this process under the form of sparse single-pixel annotations in the target data. We propose a new domain adaptation framework for semantic segmentation with annotated points via active selection.
  arXiv  Detail & Related papers  (2022-06-01T01:52:28Z)
• Adapting Segmentation Networks to New Domains by Disentangling Latent Representations [14.050836886292869]
  Domain adaptation approaches have come into play to transfer knowledge acquired on a label-abundant source domain to a related label-scarce target domain. We propose a novel performance metric to capture the relative efficacy of an adaptation strategy compared to supervised training.
  arXiv  Detail & Related papers  (2021-08-06T09:43:07Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• 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)
• Effective Label Propagation for Discriminative Semi-Supervised Domain Adaptation [76.41664929948607]
  Semi-supervised domain adaptation (SSDA) methods have demonstrated great potential in large-scale image classification tasks. We present a novel and effective method to tackle this problem by using effective inter-domain and intra-domain semantic information propagation. Our source code and pre-trained models will be released soon.
  arXiv  Detail & Related papers  (2020-12-04T14:28:19Z)
• Domain Adaptation for Semantic Parsing [68.81787666086554]
  We propose a novel semantic for domain adaptation, where we have much fewer annotated data in the target domain compared to the source domain. Our semantic benefits from a two-stage coarse-to-fine framework, thus can provide different and accurate treatments for the two stages. Experiments on a benchmark dataset show that our method consistently outperforms several popular domain adaptation strategies.
  arXiv  Detail & Related papers  (2020-06-23T14:47:41Z)

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.