通过双向关联图提升医学图像分割在少样本和跨域下的性能
BCMDA: Bidirectional Correlation Maps Domain Adaptation for Mixed Domain Semi-Supervised Medical Image Segmentation
- 构建虚拟域并用双向混合策略实现跨域知识迁移
- 在3个公开数据集上仅用少量标注样本即达领先效果
- 适合医疗图像少样本分割与跨域场景的研究者
在混合域半监督医学图像分割(MiDSS)中,面对域偏移和标注稀缺的挑战,现有方法存在两大问题:一是标注与未标注数据分布差异大,阻碍知识迁移;二是未标注数据学习效率低,导致严重确认偏差。本文提出双向关联图域适应框架(BCMDA),一方面通过虚拟域桥接(KTVDB)促进跨域学习:利用标注与未标注数据间的双向关联图,合成虚拟图像,并采用固定比例和渐进动态MixUp两种策略生成虚拟样本;再结合双路双向CutMix,在固定虚拟域内实现初始知识传递,并逐步将标注域知识迁移到真实未标注域。另一方面,为缓解确认偏差,引入原型对齐与伪标签校正(PAPLC):通过可学习的原型余弦相似度分类器,实现虚拟域与真实域间的双向原型对齐,获得更平滑紧凑的特征表示;并基于原型生成更可靠的伪标签。在三个公开多域数据集上的实验表明,该方法显著优于现有方法,尤其在极少数标注样本下表现优异。
原文摘要 · Abstract (English)
In mixed domain semi-supervised medical image segmentation (MiDSS), achieving superior performance under domain shift and limited annotations is challenging. This scenario presents two primary issues: (1) distributional differences between labeled and unlabeled data hinder effective knowledge transfer, and (2) inefficient learning from unlabeled data causes severe confirmation bias. In this paper, we propose the bidirectional correlation maps domain adaptation (BCMDA) framework to overcome these issues. On the one hand, we employ knowledge transfer via virtual domain bridging (KTVDB) to facilitate cross-domain learning. First, to construct a distribution-aligned virtual domain, we leverage bidirectional correlation maps between labeled and unlabeled data to synthesize both labeled and unlabeled images, which are then mixed with the original images to generate virtual images using two strategies, a fixed ratio and a progressive dynamic MixUp. Next, dual bidirectional CutMix is used to enable initial knowledge transfer within the fixed virtual domain and gradual knowledge transfer from the dynamically transitioning labeled domain to the real unlabeled domains. On the other hand, to alleviate confirmation bias, we adopt prototypical alignment and pseudo label correction (PAPLC), which utilizes learnable prototype cosine similarity classifiers for bidirectional prototype alignment between the virtual and real domains, yielding smoother and more compact feature representations. Finally, we use prototypical pseudo label correction to generate more reliable pseudo labels. Empirical evaluations on three public multi-domain datasets demonstrate the superiority of our method, particularly showing excellent performance even with very limited labeled samples. Code available at https://github.com/pascalcpp/BCMDA.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。