Robust Source-Free Domain Adaptation for Fundus Image Segmentation

Lingrui Li, Yanfeng Zhou, Ge Yang
10/25/2023
cs.CV

Official code: LinGrayy/PLPB (13 stars, last commit 2024-01-26).

Abstract

Unsupervised Domain Adaptation (UDA) is a learning technique that transfers knowledge learned in the source domain from labelled training data to the target domain with only unlabelled data. It is of significant importance to medical image segmentation because of the usual lack of labelled training data. Although extensive efforts have been made to optimize UDA techniques to improve the accuracy of segmentation models in the target domain, few studies have addressed the robustness of these models under UDA. In this study, we propose a two-stage training strategy for robust domain adaptation. In the source training stage, we utilize adversarial sample augmentation to enhance the robustness and generalization capability of the source model. And in the target training stage, we propose a novel robust pseudo-label and pseudo-boundary (PLPB) method, which effectively utilizes unlabeled target data to generate pseudo labels and pseudo boundaries that enable model self-adaptation without requiring source data. Extensive experimental results on cross-domain fundus image segmentation confirm the effectiveness and versatility of our method. Source code of this study is openly accessible at https://github.com/LinGrayy/PLPB.

View on arXivView PDF

Code Implementations(1)

LinGrayy/PLPBOfficial100%

Datasets & Code for the WACV 2024 paper 'Robust Source-Free Domain Adaptation for Fundus Image Segmentation'

132PythonOct 25, 20232 years ago

Similar Papers

Cite this paper

@article{li2023robust,
  title  = {Robust Source-Free Domain Adaptation for Fundus Image Segmentation},
  author = {Lingrui Li and Yanfeng Zhou and Ge Yang},
  year   = {2023},
  eprint = {2310.16665},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.16665v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.16665.svg)](https://codeofpaper.com/paper/2310.16665)

Discussion