Search

3D visualisation and modelling of anatomical structures of the human body play a significant role in diagnosis, computer-aided surgery, surgical planning, and patient follow-up. However, 2D X-ray images are often used in clinical routine. We propose and validate a method for reconstructing 3D shapes from 2D X-ray scans. This method comprises automatic segmentation and labelling, automated construction of 3D statistical shape models (SSM), and automatic fitting of the SSM to standard 2D X-ray images. This workflow is applied to finger bone shape reconstruction and validated for each finger bone using a set of five synthetic reference configurations and 34 CT/X-ray data pairs. We reached submillimetre accuracy for 91.59% of the synthetic data, while 79.65% of the clinical cases show surface errors below 2 mm. Thus, applying the proposed method can add valuable 3D information where 3D imaging is not indicated. Moreover, 3D imaging can be avoided if the 2D-3D reconstruction accuracy is sufficient. [ABSTRACT FROM AUTHOR]

Simple Summary: While MRI is primarily used for vitality analysis in multiple myeloma, the detection of osteolytic manifestations in the mineralized bone is performed on CT scans. For this study based on a homogenous sample of 20 patients with newly diagnosed multiple myeloma, we hypothesized that sequential CT studies can be used to validate remineralization quantitatively and qualitatively as a measure of treatment response. After six cycles of standardized induction therapy with the anti-SLAMF7 antibody elotuzumab in combination with carfilzomib, lenalidomide, and dexamethasone (E-KRd), we were able to record a substantial lesion size decrease associated with the formation of trabecular sclerosis in the majority of responding manifestations. Multiple myeloma (MM) frequently induces persisting osteolytic manifestations despite hematologic treatment response. This study aimed to establish a biometrically valid study endpoint for bone remineralization through quantitative and qualitative analyses in sequential CT scans. Twenty patients (seven women, 58 ± 8 years) with newly diagnosed MM received standardized induction therapy comprising the anti-SLAMF7 antibody elotuzumab, carfilzomib, lenalidomide, and dexamethasone (E-KRd). All patients underwent whole-body low-dose CT scans before and after six cycles of E-KRd. Two radiologists independently recorded osteolytic lesion sizes, as well as the presence of cortical destruction, pathologic fractures, rim and trabecular sclerosis. Bland–Altman analyses and Krippendorff's α were employed to assess inter-reader reliability, which was high for lesion size measurement (standard error 1.2 mm) and all qualitative criteria assessed (α ≥ 0.74). After six cycles of E-KRd induction, osteolytic lesion size decreased by 22% (p < 0.001). While lesion size response did not correlate with the initial lesion size at baseline imaging (Pearson's r = 0.144), logistic regression analysis revealed that the majority of responding osteolyses exhibited trabecular sclerosis (p < 0.001). The sum of osteolytic lesion sizes on sequential CT scans defines a reliable study endpoint to characterize bone remineralization. Patient level response is strongly associated with the presence of trabecular sclerosis. [ABSTRACT FROM AUTHOR]

Automatic Non-rigid Histological Image Registration (ANHIR) challenge was organized to compare the performance of image registration algorithms on several kinds of microscopy histology images in a fair and independent manner. We have assembled 8 datasets, containing 355 images with 18 different stains, resulting in 481 image pairs to be registered. Registration accuracy was evaluated using manually placed landmarks. In total, 256 teams registered for the challenge, 10 submitted the results, and 6 participated in the workshop. Here, we present the results of 7 well-performing methods from the challenge together with 6 well-known existing methods. The best methods used coarse but robust initial alignment, followed by non-rigid registration, used multiresolution, and were carefully tuned for the data at hand. They outperformed off-the-shelf methods, mostly by being more robust. The best methods could successfully register over 98% of all landmarks and their mean landmark registration accuracy (TRE) was 0.44% of the image diagonal. The challenge remains open to submissions and all images are available for download. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this study was to assess, using an anthropomorphic digital phantom, the accuracy of algorithms in registering precontrast and contrast‐enhanced computed tomography (CT) chest images for generation of iodine maps of the pulmonary parenchyma via temporal subtraction. Materials and methods: The XCAT phantom, with enhanced airway and pulmonary vessel structures, was used to simulate precontrast and contrast‐enhanced chest images at various inspiration levels and added CT simulation for realistic system noise. Differences in diaphragm position were varied between 0 and 20 mm, with the maximum chosen to exceed the 95th percentile found in a dataset of 100 clinical subtraction CTs. In addition, the influence of whole body movement, degree of iodine enhancement, beam hardening artifacts, presence of nodules and perfusion defects in the pulmonary parenchyma, and variation in noise on the registration were also investigated. Registration was performed using three lung registration algorithms — a commercial (algorithm A) and a prototype (algorithm B) version from Canon Medical Systems and an algorithm from the MEVIS Fraunhofer institute (algorithm C). For each algorithm, we calculated the voxel‐by‐voxel difference between the true deformation and the algorithm‐estimated deformation in the lungs. Results: The median absolute residual error for all three algorithms was smaller than the voxel size (1.0 × 1.0 × 1.0 mm3) for up to an 8 mm diaphragm difference, which is the average difference in diaphragm levels found clinically, and increased with increasing difference in diaphragm position. At 20 mm diaphragm displacement, the median absolute residual error after registration was 0.85 mm (interquartile range, 0.51–1.47 mm) for algorithm A, 0.82 mm (0.50–1.40 mm) for algorithm B, and 0.91 mm (0.54–1.52 mm) for algorithm C. The largest errors were seen in the paracardiac regions and close to the diaphragm. The impact of all other evaluated conditions on the residual error varied, resulting in an increase in the median residual error lower than 0.1 mm for all algorithms, except in the case of whole body displacements for algorithm B, and with increased noise for algorithm C. Conclusion: Motion correction software can compensate for respiratory and cardiac motion with a median residual error below 1 mm, which was smaller than the voxel size, with small differences among the tested registration algorithms for different conditions. Perfusion defects above 50 mm will be visible with the commercially available subtraction CT software, even in poorly registered areas, where the median residual error in that area was 7.7 mm. [ABSTRACT FROM AUTHOR]

We present a novel algorithm for the registration of pulmonary CT scans. Our method is designed for large respiratory motion by integrating sparse keypoint correspondences into a dense continuous optimization framework. The detection of keypoint correspondences enables robustness against large deformations by jointly optimizing over a large number of potential discrete displacements, whereas the dense continuous registration achieves subvoxel alignment with smooth transformations. Both steps are driven by the same normalized gradient fields data term. We employ curvature regularization and a volume change control mechanism to prevent foldings of the deformation grid and restrict the determinant of the Jacobian to physiologically meaningful values. Keypoint correspondences are integrated into the dense registration by a quadratic penalty with adaptively determined weight. Using a parallel matrix-free derivative calculation scheme, a runtime of about 5 min was realized on a standard PC. The proposed algorithm ranks first in the EMPIRE10 challenge on pulmonary image registration. Moreover, it achieves an average landmark distance of 0.82 mm on the DIR-Lab COPD database, thereby improving upon the state of the art in accuracy by 15%. Our algorithm is the first to reach the inter-observer variability in landmark annotation on this dataset. [ABSTRACT FROM PUBLISHER]

Three-dimensional (3D) image registration is a computationally intensive problem which is commonly solved in medical imaging. The complexity of the problem stems from its size and nonlinearity. In this paper we present an approach that drastically reduces the problem size by using adaptive mesh refinement. Our approach requires special and careful discretization of the variational form on adaptive quad/octree grids. It further requires an appropriate refinement criterion. We show that in some cases this approach can reduce the computational time by a factor of approximately 10 or so in two dimensions and 5 in three dimensions compared to the nonadaptive approach. [ABSTRACT FROM AUTHOR]

Even for reasonably sized three-dimensional (3D) images, image registration becomes a computationally intensive task. Here, we introduce and explore the concept of octrees for registration which drastically reduces the amount of processed data and thus the computational costs. We show how to map the registration problem onto an octree and present a suitable optimization technique. Furthermore, we demonstrate the performance of the new approach by academic (two-dimensional) as well as real life (3D) examples. These examples indicate that the computational time can be reduced by a factor of 3-4 compared with standard approaches. [ABSTRACT FROM AUTHOR]

Introduction: The automatic segmentation of brain parenchyma and cerebrospinal fluid-filled spaces such as the ventricular system is the first step for quantitative and qualitative analysis of brain CT data. For clinical practice and especially for diagnostics, it is crucial that such a method is robust to anatomical variability and pathological changes such as (hemorrhagic or neoplastic) lesions and chronic defects. This study investigates the increase in overall robustness of a deep learning algorithm that is gained by adding hemorrhage training data to an otherwise normal training cohort., Methods: A 2D U-Net is trained on subjects with normal appearing brain anatomy. In a second experiment the training data includes additional subjects with brain hemorrhage on image data of the RSNA Brain CT Hemorrhage Challenge with custom reference segmentations. The resulting networks are evaluated on normal and hemorrhage test casesseparately, and on an independent test set of patients with brain tumors of the publicly available GLIS-RT dataset., Results: Adding data with hemorrhage to the training set significantly improves the segmentation performance over an algorithm trained exclusively on normally appearing data, not only in the hemorrhage test set but also in the tumor test set. The performance on normally appearing data is stable. Overall, the improved algorithm achieves median Dice scores of 0.98 (parenchyma), 0.91 (left ventricle), 0.90 (right ventricle), 0.81 (third ventricle), and 0.80 (fourth ventricle) on the hemorrhage test set. On the tumor test set, the median Dice scores are 0.96 (parenchyma), 0.90 (left ventricle), 0.90 (right ventricle), 0.75 (third ventricle), and 0.73 (fourth ventricle)., Conclusion: Training on an extended data set that includes pathologies is crucial and significantly increases the overall robustness of a segmentation algorithm for brain parenchyma and ventricular system in CT data, also for anomalies completely unseen during training. Extension of the training set to include other diseases may further improve the generalizability of the algorithm., Competing Interests: The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest., (Copyright © 2023 Gerken, Walluscheck, Kohlmann, Galinovic, Villringer, Fiebach, Klein and Heldmann.)

Image registration is a fundamental medical image analysis task, and a wide variety of approaches have been proposed. However, only a few studies have comprehensively compared medical image registration approaches on a wide range of clinically relevant tasks. This limits the development of registration methods, the adoption of research advances into practice, and a fair benchmark across competing approaches. The Learn2Reg challenge addresses these limitations by providing a multi-task medical image registration data set for comprehensive characterisation of deformable registration algorithms. A continuous evaluation will be possible at https://learn2reg.grand-challenge.org. Learn2Reg covers a wide range of anatomies (brain, abdomen, and thorax), modalities (ultrasound, CT, MR), availability of annotations, as well as intra- and inter-patient registration evaluation. We established an easily accessible framework for training and validation of 3D registration methods, which enabled the compilation of results of over 65 individual method submissions from more than 20 unique teams. We used a complementary set of metrics, including robustness, accuracy, plausibility, and runtime, enabling unique insight into the current state-of-the-art of medical image registration. This paper describes datasets, tasks, evaluation methods and results of the challenge, as well as results of further analysis of transferability to new datasets, the importance of label supervision, and resulting bias. While no single approach worked best across all tasks, many methodological aspects could be identified that push the performance of medical image registration to new state-of-the-art performance. Furthermore, we demystified the common belief that conventional registration methods have to be much slower than deep-learning-based methods.

Registration methods facilitate the comparison of multiparametric magnetic resonance images acquired at different stages of brain tumor treatments. Image-based registration solutions are influenced by the sequences chosen to compute the distance measure, and the lack of image correspondences due to the resection cavities and pathological tissues. Nonetheless, an evaluation of the impact of these input parameters on the registration of longitudinal data is still missing. This work evaluates the influence of multiple sequences, namely T1-weighted (T1), T2-weighted (T2), contrast enhanced T1-weighted (T1-CE), and T2 Fluid Attenuated Inversion Recovery (FLAIR), and the exclusion of the pathological tissues on the non-rigid registration of pre- and post-operative images. We here investigate two types of registration methods, an iterative approach and a convolutional neural network solution based on a 3D U-Net. We employ two test sets to compute the mean target registration error (mTRE) based on corresponding landmarks. In the first set, markers are positioned exclusively in the surroundings of the pathology. The methods employing T1-CE achieves the lowest mTREs, with a improvement up to 0.8 mm for the iterative solution. The results are higher than the baseline when using the FLAIR sequence. When excluding the pathology, lower mTREs are observable for most of the methods. In the second test set, corresponding landmarks are located in the entire brain volumes. Both solutions employing T1-CE obtain the lowest mTREs, with a decrease up to 1.16 mm for the iterative method, whereas the results worsen using the FLAIR. When excluding the pathology, an improvement is observable for the CNN method using T1-CE. Both approaches utilizing the T1-CE sequence obtain the best mTREs, whereas the FLAIR is the least informative to guide the registration process. Besides, the exclusion of pathology from the distance measure computation improves the registration of the brain tissues surrounding the tumor. Thus, this work provides the first numerical evaluation of the influence of these parameters on the registration of longitudinal magnetic resonance images, and it can be helpful for developing future algorithms., Competing Interests: The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest., (Copyright © 2022 Canalini, Klein, Waldmannstetter, Kofler, Cerri, Hering, Heldmann, Schlaeger, Menze, Wiestler, Kirschke and Hahn.)