TotalSegmentator MRI is an open-source, user-friendly tool that provides automatic, robust sequence-independent segmentations of major anatomic structures on MRI scans; the ready-to-use online tool is available at https://totalsegmentator.com .
The delineation of the clinical target volumes (CTVs) for radiation therapy is time-consuming, requires intensive training and shows high inter-observer variability. Supervised deep-learning methods depend heavily on consistent training data; thus, State-of-the-Art research focuses on making CTV labels more homogeneous and strictly bounding them to current standards. International consensus expert guidelines standardize CTV delineation by conditioning the extension of the clinical target volume on the surrounding anatomical structures. Training strategies that directly follow the construction rules given in the expert guidelines or the possibility of quantifying the conformance of manually drawn contours to the guidelines are still missing. Seventy-one anatomical structures that are relevant to CTV delineation in head- and neck-cancer patients, according to the expert guidelines, were segmented on 104 computed tomography scans, to assess the possibility of automating their segmentation by State-of-the-Art deep learning methods. All 71 anatomical structures were subdivided into three subsets of non-overlapping structures, and a 3D nnU-Net model with five-fold cross-validation was trained for each subset, to automatically segment the structures on planning computed tomography scans. We report the DICE, Hausdorff distance and surface DICE for 71 + 5 anatomical structures, for most of which no previous segmentation accuracies have been reported. For those structures for which prediction values have been reported, our segmentation accuracy matched or exceeded the reported values. The predictions from our models were always better than those predicted by the TotalSegmentator. The sDICE with 2 mm margin was larger than 80% for almost all the structures. Individual structures with decreased segmentation accuracy are analyzed and discussed with respect to their impact on the CTV delineation following the expert guidelines. No deviation is expected to affect the rule-based automation of the CTV delineation.
Objective. We propose an integration scheme for a biomechanical motion model into a deformable image registration. We demonstrate its accuracy and reproducibility for adaptive radiation therapy in the head and neck region. Approach . The novel registration scheme for the bony structures in the head and neck regions is based on a previously developed articulated kinematic skeleton model. The realized iterative single-bone optimization process directly triggers posture changes of the articulated skeleton, exchanging the transformation model within the deformable image registration process. Accuracy in terms of target registration errors in the bones is evaluated for 18 vector fields of three patients between each planning CT and six fraction CT scans distributed along the treatment course. Main results . The median of target registration error distribution of the landmark pairs is 1.4 ± 0.3 mm. This is sufficient accuracy for adaptive radiation therapy. The registration performs equally well for all three patients and no degradation of the registration accuracy can be observed throughout the treatment. Significance . Deformable image registration, despite its known residual uncertainties, is until now the tool of choice towards online re-planning automation. By introducing a biofidelic motion model into the optimization, we provide a viable way towards an in-build quality assurance.
Objective. The field of radiotherapy is highly marked by the lack of datasets even with the availability of public datasets. Our study uses a very limited dataset to provide insights on essential parameters needed to automatically and accurately segment individual bones on planning CT images of head and neck cancer patients. Approach. The study was conducted using 30 planning CT images of real patients acquired from 5 different cohorts. 15 cases from 4 cohorts were randomly selected as training and validation datasets while the remaining were used as test datasets. Four experimental sets were formulated to explore parameters such as background patch reduction, class-dependent augmentation and incorporation of a weight map on the loss function. Main results. Our best experimental scenario resulted in a mean Dice score of 0.93 ± 0.06 for other bones (skull, mandible, scapulae, clavicles, humeri and hyoid), 0.93 ± 0.02 for ribs and 0.88 ± 0.03 for vertebrae on 7 test cases from the same cohorts as the training datasets. We compared our proposed solution approach to a retrained nnU-Net and obtained comparable results for vertebral bones while outperforming in the correct identification of the left and right instances of ribs, scapulae, humeri and clavicles. Furthermore, we evaluated the generalization capability of our proposed model on a new cohort and the mean Dice score yielded 0.96 ± 0.10 for other bones, 0.95 ± 0.07 for ribs and 0.81 ± 0.19 for vertebrae on 8 test cases. Significance. With these insights, we are challenging the utilization of an automatic and accurate bone segmentation tool into the clinical routine of radiotherapy despite the limited training datasets.
7 August 2026 in SIAM Journal on Mathematics of Data Science
Layer factorization has emerged as a widely used technique for training memory-efficient neural networks. However, layer factorization methods face several challenges, particularly a lack of robustness during the training process. To overcome this limitation, dynamical low-rank training methods have been developed, utilizing robust time integration techniques for low-rank matrix differential equations. Although these approaches facilitate efficient training, they still depend on computationally intensive QR and singular value decompositions of matrices with small rank. In this work, we introduce a novel low-rank training method that reduces the number of required QR decompositions. Our approach integrates an augmentation step into a projector-splitting scheme, ensuring that a subsequence of the projected gradient converges to zero in probability. We provide a rigorous theoretical analysis of the proposed method and demonstrate its effectiveness across multiple benchmarks.