Mutual Information-based Registration Algorithm Research Articles

De-enhancing the dynamic contrast-enhanced breast MRI for robust registration.

Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues in the breast. We present an iterative optimization algorithm to de-enhance the dynamic contrast-enhanced breast MRI and then register them for avoiding the effects of enhancement on image registration. In particular, the spatially varying enhancements are modeled by a Markov Random Field, and estimated by a locally smooth function with boundaries using a graph cut algorithm. The de-enhanced images are then registered by conventional B-spline based registration algorithm. These two steps benefit from each other and are repeated until the results converge. Experimental results show that our two-step registration algorithm performs much better than conventional mutual information based registration algorithm. Also, the effects of tumor shrinking in the conventional registration algorithms can be effectively avoided by our registration algorithm.

Mesh-to-raster region-of-interest-based nonrigid registration of multimodal images.

Region of interest (RoI) alignment in medical images plays a crucial role in diagnostics, procedure planning, treatment, and follow-up. Frequently, a model is represented as triangulated mesh while the patient data is provided from computed axial tomography scanners as pixel or voxel data. Previously, we presented a 2-D method for curve-to-pixel registration. This paper contributes (i)a general mesh-to-raster framework to register RoIs in multimodal images; (ii)a 3-D surface-to-voxel application, and (iii)a comprehensive quantitative evaluation in 2-D using ground truth (GT) provided by the simultaneous truth and performance level estimation (STAPLE) method. The registration is formulated as a minimization problem, where the objective consists of a data term, which involves the signed distance function of the RoI from the reference image and a higher order elastic regularizer for the deformation. The evaluation is based on quantitative light-induced fluoroscopy (QLF) and digital photography (DP) of decalcified teeth. STAPLE is computed on 150 image pairs from 32 subjects, each showing one corresponding tooth in both modalities. The RoI in each image is manually marked by three experts (900 curves in total). In the QLF-DP setting, our approach significantly outperforms the mutual information-based registration algorithm implemented with the Insight Segmentation and Registration Toolkit and Elastix.

Registration of phase-contrast images in propagation-based X-ray phase tomography.

X-ray phase tomography aims at reconstructing the 3D electron density distribution of an object. It offers enhanced sensitivity compared to attenuation-based X-ray absorption tomography. In propagation-based methods, phase contrast is achieved by letting the beam propagate after interaction with the object. The phase shift is then retrieved at each projection angle, and subsequently used in tomographic reconstruction to obtain the refractive index decrement distribution, which is proportional to the electron density. Accurate phase retrieval is achieved by combining images at different propagation distances. For reconstructions of good quality, the phase-contrast images recorded at different distances need to be accurately aligned. In this work, we characterise the artefacts related to misalignment of the phase-contrast images, and investigate the use of different registration algorithms for aligning in-line phase-contrast images. The characterisation of artefacts is done by a simulation study and comparison with experimental data. Loss in resolution due to vibrations is found to be comparable to attenuation-based computed tomography. Further, it is shown that registration of phase-contrast images is nontrivial due to the difference in contrast between the different images, and the often periodical artefacts present in the phase-contrast images if multilayer X-ray optics are used. To address this, we compared two registration algorithms for aligning phase-contrast images acquired by magnified X-ray nanotomography: one based on cross-correlation and one based on mutual information. We found that the mutual information-based registration algorithm was more robust than a correlation-based method.

Automatic Prospective Registration of High-Resolution Trabecular Bone Images of the Tibia

Magnetic Resonance Imaging (MRI) longitudinal studies conducted to assess changes in tibia bone quality impose strict requirements on the reproducibility of the prescribed region acquired. Registration, the process of aligning two images, is commonly performed on the images after acquisition. However, techniques to improve image registration precision by adjusting scanning parameters prospectively, prior to image acquisition, would be preferred. We have adapted an automatic prospective mutual information based registration algorithm to a MRI longitudinal study of trabecular bone of the tibia and compared it to a post-scan manual registration. Qualitatively, image alignment due to the prospective registration is shown in 2D subtraction images and 3D surface renderings. Quantitatively, the registration performance is demonstrated by calculating the sum of the squares of the subtraction images. Results show that the sum of the squares is lower for the follow up images with prospective registration by an average of 19.37% +/- 0.07 compared to follow up images with post-scan manual registration. Our study found no significant difference between the trabecular bone structure parameters calculated from the post-scan manual registration and the prospective registration images (p > 0.05). All coefficient of variation values for all trabecular bone structure parameters were within a 2-4.5% range which are within values previously reported in the literature. Results suggest that this algorithm is robust enough to be used in different musculoskeletal imaging applications including the hip as well as the tibia.

Demonstration of accuracy and clinical versatility of mutual information for automatic multimodality image fusion using affine and thin-plate spline warped geometric deformations

This paper applies and evaluates an automatic mutual information-based registration algorithm across a broad spectrum of multimodal volume data sets. The algorithm requires little or no pre-processing, minimal user input and easily implements either affine, i.e. linear or thin-plate spline (TPS) warped registrations. We have evaluated the algorithm in phantom studies as well as in selected cases where few other algorithms could perform as well, if at all, to demonstrate the value of this new method. Pairs of multimodal gray-scale volume data sets were registered by iteratively changing registration parameters to maximize mutual information. Quantitative registration errors were assessed in registrations of a thorax phantom using PET/CT and in the National Library of Medicine's Visible Male using MRI T2-/T1-weighted acquisitions. Registrations of diverse clinical data sets were demonstrated including rotate—translate mapping of PET/MRI brain scans with significant missing data, full affine mapping of thoracic PET/CT and rotate—translate mapping of abdominal SPECT/CT. A five-point thin-plate spline (TPS) warped registration of thoracic PET/CT is also demonstrated. The registration algorithm converged in times ranging between 3.5 and 31 min for affine clinical registrations and 57 min for TPS warping. Mean error vector lengths for rotate—translate registrations were measured to be subvoxel in phantoms. More importantly the rotate—translate algorithm performs well even with missing data. The demonstrated clinical fusions are qualitatively excellent at all levels. We conclude that such automatic, rapid, robust algorithms significantly increase the likelihood that multimodality registrations will be routinely used to aid clinical diagnoses and post-therapeutic assessment in the near future.