Adversarial Semi-Supervised Domain Adaptation for Semantic Segmentation: A New Role for Labeled Target Samples
Not on the map. Why?
Abstract (arXiv)
Adversarial learning baselines for domain adaptation (DA) approaches in the context of semantic segmentation are under explored in semi-supervised framework. These baselines involve solely the available labeled target samples in the supervision loss. In this work, we propose to enhance their usefulness on both semantic segmentation and the single domain classifier neural networks. We design new training objective losses for cases when labeled target data behave as source samples or as real target samples. The underlying rationale is that considering the set of labeled target samples as part of source domain helps reducing the domain discrepancy and, hence, improves the contribution of the adversarial loss. To support our approach, we consider a complementary method that mixes source and labeled target data, then applies the same adaptation process. We further propose an unsupervised selection procedure using entropy to optimize the choice of labeled target samples for adaptation. We illustrate our findings through extensive experiments on the benchmarks GTA5, SYNTHIA, and Cityscapes. The empirical evaluation highlights competitive performance of our proposed approach.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 12 Dec 2023.
Builds on
22 of 30 references.
References · 22
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
- 2016Playing for Data: Ground Truth from Computer Gamescited by 816
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
- 2018ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentationcited by 623
- 2018Learning to Adapt Structured Output Space for Semantic Segmentationcited by 584
- 2019Confidence Regularized Self-Trainingcited by 418
- 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 340
10 more
- 2019Semi-supervised Domain Adaptation via Minimax Entropycited by 333
- 2019Domain Adaptation for Semantic Segmentation with Maximum Squares Losscited by 138
- 2017Adversarial Dropout Regularizationcited by 106
- 2021Torch.manual_seed(3407) is all you need: On the influence of random seeds in deep learning architectures for computer visioncited by 76
- 2020Attract, Perturb, and Explore: Learning a Feature Alignment Network for Semi-supervised Domain Adaptationcited by 69
- 2020Alleviating Semantic-level Shift: A Semi-supervised Domain Adaptation Method for Semantic Segmentationcited by 35
- 2021Semi-supervised Domain Adaptation based on Dual-level Domain Mixing for Semantic Segmentationcited by 33
- 2021Domain Adaptation for Semantic Segmentation via Patch-Wise Contrastive Learningcited by 30
- 2022A Simple Data Mixing Prior for Improving Self-Supervised Learningcited by 27
- 2021MLAN: Multi-Level Adversarial Network for Domain Adaptive Semantic Segmentationcited by 16
Built on by
Not cited yet.