Parallel Computation of Nonrigid Image Registration

Automatic intensity-based nonrigid image registration brings significant impact in medical applications such as multimodality fusion of images, serial comparison for monitoring disease progression or regression, and minimally invasive image-guided interventions. However, due to memory and compute intensive nature of the operations, intensity-based image registration has remained too slow to be practical for clinical adoption, with its use limited primarily to as a pre-operative too. Efficient registration methods can lead to new possibilities for development of improved and interactive intraoperative tools and capabilities. In this thesis, we propose an efficient parallel implementation for intensity-based three-dimensional nonrigid image registration on a commodity graphics processing unit. Optimization techniques are developed to accelerate the compute-intensive mutual information computation. The study is performed on the hierarchical volume subdivision-based algorithm, which is inherently faster than other nonrigid registration algorithms and structurally well-suited for data-parallel computation platforms. The proposed implementation achieves more than 50-fold runtime improvement over a standard implementation on a CPU. The execution time of nonrigid image registration is reduced from hours to minutes while retaining the same level of registration accuracy

Intensity based image registration of satellite images using evolutionary techniques

Image registration is the fundamental image processing technique to determine geometrical transformation that gives the most accurate match between reference and floating images. Its main aim is to align two images. Satellite images to be fused for numerous applications must be registered before use. The main challenges in satellite image registration are finding out the optimum transformation parameters. Here in this work the non-alignment parameters are considered to be rigid and affine transformation. An intensity based satellite image registration technique is being used to register the floating image to the native co-ordinate system where the normalized mutual information (NMI) is taken as the similarity metric for optimizing and updating transform parameters. Because of no assumptions are made regarding the nature of the relationship between the image intensities in both modalities NMI is very general and powerful and can be applied automatically without prior segmentation on a large variety of data and as well works better for overlapped images as compared to mutual information(MI). In order to get maximum accuracy of registration the NMI is optimized using Genetic algorithm, particle swarm optimization and hybrid GA-PSO. The random initialization and computational complexity makes GA oppressive, whereas weak local search ability with a premature convergence is the main drawback of PSO. Hybrid GA-PSO makes a trade-off between the local and global search in order to achieve a better balance between convergence speed and computational complexity. The above registration algorithm is being validated with several satellite data sets. The hybrid GA-PSO outperforms in terms of optimized NMI value and percentage of mis-registration error

Negative exponential behavior of image mutual information for pseudo-thermal light ghost imaging: Observation, modeling, and verification

When use the image mutual information to assess the quality of reconstructed image in pseudo-thermal light ghost imaging, a negative exponential behavior with respect to the measurement number is observed. Based on information theory and a few simple and verifiable assumptions, semi-quantitative model of image mutual information under varying measurement numbers is established. It is the Gaussian characteristics of the bucket detector output probability distribution that leads to this negative exponential behavior. Designed experiments verify the model.Comment: 13 pages, 6 figure

Registration of Brain MRI/PET Images Based on Adaptive Combination of Intensity and Gradient Field Mutual Information

Traditional mutual information (MI) function aligns two multimodality images with intensity information, lacking spatial information, so that it usually presents many local maxima that can lead to inaccurate registration. Our paper proposes an algorithm of adaptive combination of intensity and gradient field mutual information (ACMI). Gradient code maps (GCM) are constructed by coding gradient field information of corresponding original images. The gradient field MI, calculated from GCMs, can provide complementary properties to intensity MI. ACMI combines intensity MI and gradient field MI with a nonlinear weight function, which can automatically adjust the proportion between two types MI in combination to improve registration. Experimental results demonstrate that ACMI outperforms the traditional MI and it is much less sensitive to reduced resolution or overlap of images

Locally Orderless Registration

Image registration is an important tool for medical image analysis and is used to bring images into the same reference frame by warping the coordinate field of one image, such that some similarity measure is minimized. We study similarity in image registration in the context of Locally Orderless Images (LOI), which is the natural way to study density estimates and reveals the 3 fundamental scales: the measurement scale, the intensity scale, and the integration scale. This paper has three main contributions: Firstly, we rephrase a large set of popular similarity measures into a common framework, which we refer to as Locally Orderless Registration, and which makes full use of the features of local histograms. Secondly, we extend the theoretical understanding of the local histograms. Thirdly, we use our framework to compare two state-of-the-art intensity density estimators for image registration: The Parzen Window (PW) and the Generalized Partial Volume (GPV), and we demonstrate their differences on a popular similarity measure, Normalized Mutual Information (NMI). We conclude, that complicated similarity measures such as NMI may be evaluated almost as fast as simple measures such as Sum of Squared Distances (SSD) regardless of the choice of PW and GPV. Also, GPV is an asymmetric measure, and PW is our preferred choice.Comment: submitte

An information-theoretic image quality measure: Comparison with statistical similarity

We present an information-theoretic approach for structural similarity for assessing gray scale image quality. The structural similarity measure SSIM, proposed in 2004, has been successflly used and verfied. SSIM is based on statistical similarity between the two images. However, SSIM can produce confusing results in some cases where it may give a non-trivial amount of similarity for two different images. Also, SSIM cannot perform well (in detecting similarity or dissimilarity) at low peak signal to noise ratio (PSNR). In this study, we present a novel image similarity measure, HSSIM, by using information - theoretic technique based on joint histogram. The proposed method has been tested under Gaussian noise. Simulation results show that the proposed measure HSSIM outperforms statistical similarity SSIM by ability to detect similarity under very low PSNR. The average difference is about 20dB

Multimodality and Nonrigid Image Registration with Application to Diffusion Tensor Imaging

The great challenge in image registration is to devise computationally efficient algorithms for aligning images so that their details overlap accurately. The first problem addressed in this thesis is multimodality medical image registration, which we formulate as an optimization problem in the information-theoretic setting. We introduce a viable and practical image registration method by maximizing a generalized entropic dissimilarity measure using a modified simultaneous perturbation stochastic approximation algorithm. The feasibility of the proposed image registration approach is demonstrated through extensive experiments. The rest of the thesis is devoted to nonrigid medical image registration. We propose an informationtheoretic framework by optimizing a non-extensive entropic similarity measure using the quasi-Newton method as an optimization scheme and cubic B-splines for modeling the nonrigid deformation field between the fixed and moving 3D image pairs. To achieve a compromise between the nonrigid registration accuracy and the associated computational cost, we implement a three-level hierarchical multi-resolution approach in such a way that the image resolution is increased in a coarse to fine fashion. The feasibility and registration accuracy of the proposed method are demonstrated through experimental results on a 3D magnetic resonance data volume and also on clinically acquired 4D computed tomography image data sets. In the same vein, we extend our nonrigid registration approach to align diffusion tensor images for multiple components by enabling explicit optimization of tensor reorientation. Incorporating tensor reorientation in the registration algorithm is pivotal in wrapping diffusion tensor images. Experimental results on diffusion-tensor image registration indicate the feasibility of the proposed approach and a much better performance compared to the affine registration method based on mutual information, not only in terms of registration accuracy in the presence of geometric distortions but also in terms of robustness in the presence of Rician noise