We present a 3-step registration pipeline for differently stained histological serial sections that consists of 1) a robust pre-alignment, 2) a parametric registration computed on coarse resolution images, and 3) an accurate nonlinear registration. In all three steps the NGF distance measure is minimized with respect to an increasingly flexible transformation. We apply the method in the ANHIR image registration challenge and evaluate its performance on the training data. The presented method is robust (error reduction in 99.6 of the cases), fast (runtime < 4 seconds) and accurate (median relative target registration error 0.0019).
The underlying variational image registration framework of this work has been described in @cite_5 @cite_10 and its application to histological images was first described in @cite_11 in 2006. A general issue has been the handling of large images and the associated computational complexity and runtimes. At this time, the elastic registration of two images from slices of a human brain with @math pixels took about 100 minutes on a workstation and 3 minutes on a cluster computer. Later, a faster implementation for regular workstations reducing memory read and write operations has been proposed in @cite_7 in 2013. The authors report a registration time of 104 seconds for a pair of images from the DIR-Lab 4DCT dataset (approx. @math voxels). Additional optimizations including the exploitation of special instruction sets of modern CPUs has been recently described in @cite_12 , reducing the registration time for two @math images to 19 seconds. The present work builds on top of these implementations.
@cite_7 @cite_5 @cite_10 @cite_12 @cite_11
2074208271 2067448964 1993487882 2109149988
We present a framework for robustly estimating registration between a 3D volume image and a 2D projection image and evaluate its precision and robustness in spine interventions for vertebral localization in the presence of anatomical deformation. The framework employs a normalized gradient information similarity metric and multi-start covariance matrix adaptation evolution strategy optimization with local-restarts, which provided improved robustness against deformation and content mismatch. The parallelized implementation allowed orders-of-magnitude acceleration in computation time and improved the robustness of registration via multi-start global optimization. Experiments involved a cadaver specimen and two CT datasets (supine and prone) and 36 C-arm fluoroscopy images acquired with the specimen in four positions (supine, prone, supine with lordosis, prone with kyphosis), three regions (thoracic, abdominal, and lumbar), and three levels of geometric magnification (1.7, 2.0, 2.4). Registration accuracy was evaluated in terms of projection distance error (PDE) between the estimated and true target points in the projection image, including 14 400 random trials (200 trials on the 72 registration scenarios) with initialization error up to ±200 mm and ±10°. The resulting median PDE was better than 0.1 mm in all cases, depending somewhat on the resolution of input CT and fluoroscopy images. The cadaver experiments illustrated the tradeoff between robustness and computation time, yielding a success rate of 99.993 in vertebral labeling (with 'success' defined as PDE <5 mm) using 1,718 664 ± 96 582 function evaluations computed in 54.0 ± 3.5 s on a mid-range GPU (nVidia, GeForce GTX690). Parameters yielding a faster search (e.g., fewer multi-starts) reduced robustness under conditions of large deformation and poor initialization (99.535 success for the same data registered in 13.1 s), but given good initialization (e.g., ±5 mm, assuming a robust initial run) the same registration could be solved with 99.993 success in 6.3 s. The ability to register CT to fluoroscopy in a manner robust to patient deformation could be valuable in applications such as radiation therapy, interventional radiology, and an assistant to target localization (e.g., vertebral labeling) in image-guided spine surgery. Maximization of mutual information of voxel intensities has been demonstrated to be a very powerful criterion for three-dimensional medical image registration, allowing robust and accurate fully automated affine registration of multimodal images in a variety of applications, without the need for segmentation or other preprocessing of the images. In this paper, we investigate the performance of various optimization methods and multiresolution strategies for maximization of mutual information, aiming at increasing registration speed when matching large high-resolution images. We show that mutual information is a continuous function of the affine registration parameters when appropriate interpolation is used and we derive analytic expressions of its derivatives that allow numerically exact evaluation of its gradient. Various multiresolution gradient- and non-gradient-based optimization strategies, such as Powell, simplex, steepest-descent, conjugate-gradient, quasi-Newton and Levenberg—Marquardt methods, are evaluated for registration of computed tomography (CT) and magnetic resonance images of the brain. Speed-ups of a factor of 3 on average compared to Powell's method at full resolution are achieved with similar precision and without a loss of robustness with the simplex, conjugate-gradient and Levenberg—Marquardt method using a two-level multiresolution scheme. Large data sets such as 2562 × 128 MR and 5122 × 48 CT images can be registered with subvoxel precision in < 5 min CPU time on current workstations. The physical (microtomy), optical (microscopy), and radiologic (tomography) sectioning of biological objects and their digitization lead to stacks of images. Due to the sectioning process and disturbances, movement of objects during imaging for example, adjacent images of the image stack are not optimally aligned to each other. Such mismatches have to be corrected automatically by suitable registration methods. Here, a whole brain of a Sprague Dawley rat was serially sectioned and stained followed by digitizing the 20 ?m thin histologic sections. We describe how to prepare the images for subsequent automatic intensity based registration. Different registration schemes are presented and their results compared to each other from an anatomical and mathematical perspective. In the first part we concentrate on rigid and affine linear methods and deal only with linear mismatches of the images. Digitized images of stained histologic sections often exhibit inhomogenities of the gray level distribution coming from staining and or sectioning variations. Therefore, a method is developed that is robust with respect to inhomogenities and artifacts. Furthermore we combined this approach by minimizing a suitable distance measure for shear and rotation mismatches of foreground objects after applying the principal axes transform. As a consequence of our investigations, we must emphasize that the combination of a robust principal axes based registration in combination with optimizing translation, rotation and shearing errors gives rise to the best reconstruction results from the mathematical and anatomical view point. Because the sectioning process introduces nonlinear deformations to the relative thin histologic sections as well, an elastic registration has to be applied to correct these deformations. In the second part of the study a detailed description of the advances of an elastic registration after affine linear registration of the rat brain is given. We found quantitative evidence that affine linear registration is a suitable starting point for the alignment of histologic sections but elastic registration must be performed to improve significantly the registration result. A strategy is presented that enables to register elastically the affine linear preregistered rat brain sections and the first one hundred images of serial histologic sections through both occipital lobes of a human brain (6112 images). Additionally, we will describe how a parallel implementation of the elastic registration was realized. Finally, the computed force fields have been applied here for the first time to the morphometrized data of cells determined automatically by an image analytic framework. In this study, we registered live-time interventional magnetic resonance imaging (iMRI) slices with a previously obtained high-resolution MRI volume that in turn can be registered with a variety of functional images, e.g., PET, SPECT, for tumor targeting. We created and evaluated a slice-to-volume (SV) registration algorithm with special features for its potential use in iMRI-guided radio-frequency (RF) thermal ablation of prostate cancer. The algorithm features included a multiresolution approach, two similarity measures, and automatic restarting to avoid local minima. Imaging experiments were performed on volunteers using a conventional 1.5-T MR scanner and a clinical 0.2-T C-arm iMRI system under realistic conditions. Both high-resolution MR volumes and actual iMRI image slices were acquired from the same volunteers. Actual and simulated iMRI images were used to test the dependence of SV registration on image noise, receive coil inhomogeneity, and RF needle artifacts. To quantitatively assess registration, we calculated the mean voxel displacement over a volume of interest between SV registration and volume-to-volume registration, which was previously shown to be quite accurate. More than 800 registration experiments were performed. For transverse image slices covering the prostate, the SV registration algorithm was 100 successful with an error of <2 mm, and the average and standard deviation was only 0.4 mm spl plusmn 0.2 mm. Visualizations such as combined sector display and contour overlay showed excellent registration of the prostate and other organs throughout the pelvis. Error was greater when an image slice was obtained at other orientations and positions, mostly because of inconsistent image content such as that from variable rectal and bladder filling. These preliminary experiments indicate that MR SV registration is sufficiently accurate to aid image-guided therapy.