One Sequence to Segment Them All: Efficient Data Augmentation for CT and MRI Cross-Domain 3D Spine Segmentation
Nathan Molinier, Hendrik M\"oller, Thomas Dagonneau, Anna Curto-Vilalta, Robert Graf, Matan Atad, Daniel Rueckert, Jan S. Kirschke, Julien Cohen-Adad

TL;DR
This paper introduces a set of GPU-optimized data augmentation techniques that significantly improve cross-modality generalization in 3D spine segmentation models for CT and MRI, with minimal impact on in-domain accuracy.
Contribution
The authors propose targeted data augmentation methods that enhance cross-modality transferability of spine segmentation models, and release an open-source toolbox compatible with nnUNet and MONAI.
Findings
Average Dice gain of 155% on unseen domains.
In-domain accuracy decreases by only 0.008%.
Training efficiency improves by approximately 10%.
Abstract
Deep learning-based medical image segmentation is increasingly used to support clinical diagnosis and develop new treatment strategies. However, model performance remains limited by the scarcity of high-quality annotated data and insufficient generalization across imaging protocols. This limitation is particularly evident in MRI and CT, where models are typically trained on a single acquisition sequence and exhibit reduced robustness when applied to unseen sequences or contrasts. Although data augmentation is widely used to improve general robustness on medical images, its impact on cross-modality generalization has not been quantitatively explored. In this work, we study a targeted set of data augmentation techniques designed to improve cross-modality transfer. We train three spine segmentation models, each on a single-modality/sequence dataset, and evaluate them across seven…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
