Pith. sign in

REVIEW

Unsupervised Domain Adaptation for Segmentation with Black-box Source Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.07769 v1 pith:OJQZH5AJ submitted 2022-08-16 cs.CV cs.AIcs.LGeess.IVeess.SP

classification cs.CVcs.AIcs.LGeess.IVeess.SP
keywords domainsourcemodeladaptationdatasegmentationtargetunsupervised
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Unsupervised domain adaptation (UDA) has been widely used to transfer knowledge from a labeled source domain to an unlabeled target domain to counter the difficulty of labeling in a new domain. The training of conventional solutions usually relies on the existence of both source and target domain data. However, privacy of the large-scale and well-labeled data in the source domain and trained model parameters can become the major concern of cross center/domain collaborations. In this work, to address this, we propose a practical solution to UDA for segmentation with a black-box segmentation model trained in the source domain only, rather than original source data or a white-box source model. Specifically, we resort to a knowledge distillation scheme with exponential mixup decay (EMD) to gradually learn target-specific representations. In addition, unsupervised entropy minimization is further applied to regularization of the target domain confidence. We evaluated our framework on the BraTS 2018 database, achieving performance on par with white-box source model adaptation approaches.

Discussion (0). Sign in to comment.

Pith tools