2021 IEEE/CVF International Conference on Computer Vision (ICCV) 2021
DOI: 10.1109/iccv48922.2021.00696
|View full text |Cite
|
Sign up to set email alerts
|

Generalize then Adapt: Source-Free Domain Adaptive Semantic Segmentation

Abstract: Unsupervised domain adaptation (DA) has gained substantial interest in semantic segmentation. However, almost all prior arts assume concurrent access to both labeled source and unlabeled target, making them unsuitable for scenarios demanding source-free adaptation. In this work 1 , we enable source-free DA by partitioning the task into two: a) source-only domain generalization and b) source-free target adaptation. Towards the former, we provide theoretical insights to develop a multi-head framework trained wit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
1

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 68 publications
(27 citation statements)
references
References 75 publications
0
26
1
Order By: Relevance
“…This method, also described by Algorithm 1, is simply executed as one forward pass for each new target domain image x D T t . Note that in contrast to previous source-free UDA methods [54], [55], [56] our CBNA method is a continual source-free UDA method (cf. Fig.…”
Section: Novel Continuous Batchnorm Adaptation (Cbna)mentioning
confidence: 97%
“…This method, also described by Algorithm 1, is simply executed as one forward pass for each new target domain image x D T t . Note that in contrast to previous source-free UDA methods [54], [55], [56] our CBNA method is a continual source-free UDA method (cf. Fig.…”
Section: Novel Continuous Batchnorm Adaptation (Cbna)mentioning
confidence: 97%
“…We denote the problem of learning multiple labeled target domains without retaining previously seen data as domain-incremental learning (DIL) [50], [51], [52], [53], [54], [55], [56], [57]. Another sub-category called source-free UDA -sometimes referred to as unsupervised model adaptation (UMA) -has recently gained increasing attention for both classification [58], [59], [60], [61] and segmentation tasks [62], [63], [64], [65], [66]. These methods perform UDA from a source to a single target domain without using the actual source data.…”
Section: Sequential Udamentioning
confidence: 99%
“…For this task some very recent methods have been developed concurrently: Teja et al [54] apply entropy minimization on the posterior and maximize the noise robustness of latent features. Kundu et al [55] use self-training on pseudo labels. Liu et al [56] also make use of this technique and in addition apply data-free knowledge distillation.…”
Section: Uda Without Source Datamentioning
confidence: 99%