mlsanityData to 7 Oct 2026

Partial annotations for the segmentation of large structures with low annotation cost

arXiv 2209.12216 ↗First posted 25 Sep 2022eess.IV cs.CV cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Deep learning methods have been shown to be effective for the automatic segmentation of structures and pathologies in medical imaging. However, they require large annotated datasets, whose manual segmentation is a tedious and time-consuming task, especially for large structures. We present a new method of partial annotations that uses a small set of consecutive annotated slices from each scan with an annotation effort that is equal to that of only few annotated cases. The training with partial annotations is performed by using only annotated blocks, incorporating information about slices outside the structure of interest and modifying a batch loss function to consider only the annotated slices. To facilitate training in a low data regime, we use a two-step optimization process. We tested the method with the popular soft Dice loss for the fetal body segmentation task in two MRI sequences, TRUFI and FIESTA, and compared full annotation regime to partial annotations with a similar annotation effort. For TRUFI data, the use of partial annotations yielded slightly better performance on average compared to full annotations with an increase in Dice score from 0.936 to 0.942, and a substantial decrease in Standard Deviations (STD) of Dice score by 22% and Average Symmetric Surface Distance (ASSD) by 15%. For the FIESTA sequence, partial annotations also yielded a decrease in STD of the Dice score and ASSD metrics by 27.5% and 33% respectively for in-distribution data, and a substantial improvement also in average performance on out-of-distribution data, increasing Dice score from 0.84 to 0.9 and decreasing ASSD from 7.46 to 4.01 mm. The two-step optimization process was helpful for partial annotations for both in-distribution and out-of-distribution data. The partial annotations method with the two-step optimizer is therefore recommended to improve segmentation performance under low data regime.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 17 references that are in the map. First posted on arXiv 25 Sep 2022.

Builds on

9 of 17 references.

References · 9

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  2. 20163D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotationcited by 1,471
  3. 2015Cyclical Learning Rates for Training Neural Networkscited by 627
  4. 2017Generalised Dice overlap as a deep learning loss function for highly unbalanced segmentationscited by 614
  5. 2018Aleatoric uncertainty estimation with test-time augmentation for medical image segmentation with convolutional neural networkscited by 278
  6. 2019Embracing Imperfect Datasets: A Review of Deep Learning Solutions for Medical Image Segmentationcited by 258
  7. 2018Recurrent neural networks for aortic image sequence segmentation with sparse annotationscited by 25
  8. 2018Iterative multi-path tracking for video and volume segmentation with sparse point supervisioncited by 6
  9. 2018Segmentation of Head and Neck Organs at Risk Using CNN with Batch Dice Losscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.