Skip to content
naulon
Not checkedNot checked for notices yet.

Pseudo Label Rectification via Co-Teaching and Decoupling for Multisource Domain Adaptation in Semantic Segmentation

So Jeong Park, Hae Ju Park, Eun Su Kang and 3 more

IEEE Access · 2022

doi:10.1109/access.2022.3202190 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Multi-source Unsupervised Domain Adaptation (MUDA) is an approach aiming to transfer the knowledge obtained from multiple labeled source domains to an unlabeled target domain. In this paper, we propose a novel self-training method for MUDA, which includes pseudo label-oriented coteaching and pseudo label decoupling that are attempted for the pseudo label rectification-based MUDA for semantic segmentation. Existing ensemble-based self-training methods which are well-known approaches for MUDA use pseudo labels made from the ensemble of the predictions of multiple models to transfer the knowledge of source domains to the target domain. In these methods, information from multiple models can be contaminated, or errors from incorrect pseudo labels can be propagated. On the other hand, the proposed pseudo label-oriented coteaching trains multiple models by using pseudo labels from the peer model without any integration of pseudo labels. Simultaneously, the pseudo label decoupling method is proposed for rectification of pseudo labels, which updates the models with two pseudo labels only if they disagree. It also alleviates the problem of class imbalance in semantic segmentation, in which dominant classes lead the update for training. The effects of the proposed pseudo label-oriented coteaching and pseudo label decoupling on the performance of semantic segmentation were verified by extensive experiments. The proposed method achieved the best semantic segmentation accuracy compared with the benchmark methods. In addition, we confirmed that the prediction accuracy of small objects was greatly improved by the proposed pseudo label rectification.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.