The purpose of this chapter is to present a survey of recent publications concerning medical image registration techniques. These publications will be classified according to a model based on nine salient criteria, the main dichotomy of which is extrinsic versus intrinsic methods The statistics of the classification show definite trends in the evolving registration techniques, which will be discussed. At this moment, the bulk of interesting intrinsic methods is either based on segmented points or surfaces, or on techniques endeavoring to use the full information content of the images involved. Keywords: registration, matching Received May 25, 1997

Abstract — In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion is described by a free-form deformation (FFD) based on B-splines. Normalized mutual information is used as a voxel-based similarity measure which is insensitive to intensity changes as a result of the contrast enhancement. Registration is achieved by minimizing a cost function, which represents a combination of the cost associated with the smoothness of the transformation and the cost associated with the image similarity. The algorithm has been applied to the fully automated registration of three-dimensional (3-D) breast MRI in volunteers and patients. In particular, we have compared the results of the proposed nonrigid registration algorithm to those obtained using rigid and affine registration techniques. The results clearly indicate that the nonrigid registration algorithm is much better able to recover the motion and deformation of the breast than rigid or affine registration algorithms. I.

Abstract—An overview is presented of the medical image processing literature on mutual-information-based registration. The aim of the survey is threefold: an introduction for those new to the field, an overview for those working in the field, and a reference for those searching for literature on a specific application. Methods are classified according to the different aspects of mutual-information-based registration. The main division is in aspects of the methodology and of the application. The part on methodology describes choices made on facets such as preprocessing of images, gray value interpolation, optimization, adaptations to the mutual information measure, and different types of geometrical transformations. The part on applications is a reference of the literature available on different modalities, on interpatient registration and on different anatomical objects. Comparison studies including mutual information are also considered. The paper starts with a description of entropy and mutual information and it closes with a discussion on past achievements and some future challenges. Index Terms—Image registration, literature survey, matching, mutual information. I.

Over the last five years, new "voxel-based" approaches have allowed important progress in multimodal image registration, notably due to the increasing use of information-theoretic similarity measures.

We propose a new method for the intermodal registration of images using a criterion known as mutual information. Our main contribution is an optimizer that we specifically designed for this criterion. We show that this new optimizer is well adapted to a multiresolution approach because it typically converges in fewer criterion evaluations than other optimizers. We have built a multiresolution image pyramid, along with an interpolation process, an optimizer, and the criterion itself, around the unifying concept of spline-processing. This ensures coherence in the way we model data and yields good performance. We have tested our approach in a variety of experimental conditions and report excellent results. We claim an accuracy of about a hundredth of a pixel under ideal conditions. We are also robust since the accuracy is still about a tenth of a pixel under very noisy conditions. In addition, a blind evaluation of our results compares very favorably to the work of several other researchers.

While intensity-based similarity measures are increasingly used for medical image registration, they often rely on implicit assumptions regarding the imaging physics. The motivation of this paper is to clarify the assumptions on which a number of popular similarity measures rely. After formalizing registration based on general image acquisition models, we show that the search for an optimal measure can be cast into a maximum likelihood estimation problem. We then derive similarity measures corresponding to different modeling assumptions and retrieve some well-known measures (correlation coefficient, correlation ratio, mutual information). Finally, we present results of rigid registration between several image modalities to illustrate the importance of choosing an appropriate similarity measure.

One major problem with nonrigid image registration techniques is their high computational cost. Because of this, these methods have found limited application to clinical situations where fast execution is required, e.g., intraoperative imaging. This paper presents a parallel implementation of a nonrigid image registration algorithm. It takes advantage of shared-memory multiprocessor computer architectures using multithreaded programming by partitioning of data and partitioning of tasks, depending on the computational subproblem. For three different biomedical applications (intraoperative brain deformation, contrast-enhanced MR mammography, intersubject brain registration), the scaling behavior of the algorithm is quantitatively analyzed. The method is demonstrated to perform the computation of intra-operative brain deformation in less than a minute using 64 CPUs on a 128-CPU shared-memory supercomputer (SGI Origin 3800). It is shown that its serial component is no more than 2% of the total computation time, allowing a speedup of at least a factor of 50. In most cases, the theoretical limit of the speedup is substantially higher (up to 132-fold in the application examples presented in this paper). The parallel implementation of our algorithm is, therefore, capable of solving nonrigid registration problems with short execution time requirements and may be considered an important step in the application of such techniques to clinically important problems such as the computation of brain deformation during cranial imageguided surgery.

We present a software package which uniquely integrates several facets of image-guided medicine into a single portable, extendable environment. It provides capabilities for automatic registration, semiautomatic segmentation, 3D surface model generation, 3D visualization, and quantitative analysis of various medical scans. We describe its system architecture, wide range of applications, and novel integration with an interventional Magnetic Resonance (MR) scanner to augment intraoperative imaging with pre-operative data. Analysis previously reserved for pre-operative data can now be applied to exploring the anatomical changes as the surgery progresses. Surgical instruments are tracked and used to drive the location of reformatted slices. Real-time scans are visualized as slices in the same 3D view along with the pre-operative slices and surface models. The system has been applied in over 20 neurosurgical cases at Brigham and Women’s Hospital, and continues to be routinely used for 1-3 cases per week.

In this paper, we extend a previously reported intensity-based nonrigid registration algorithm by using a novel regularization term to constrain the deformation. Global motion is modeled by a rigid transformation while local motion is described by a free-form deformation based on B-splines. An information theoretic measure, normalized mutual information, is used as an intensity-based image similarity measure. Registration is performed by searching for the deformation that minimizes a cost function consisting of a weighted combination of the image similarity measure and a regularization term. The novel regularization term is a local volume-preservation (incompressibility) constraint, which is motivated by the assumption that soft tissue is incompressible for small deformations and short time periods. The incompressibility constraint is implemented by penalizing deviations of the Jacobian determinant of the deformation from unity. We apply the nonrigid registration algorithm with and without the incompressibility constraint to precontrast and postcontrast magnetic resonance (MR) breast images from 17 patients. Without using a constraint, the volume of contrast-enhancing lesions decreases by 1%--78% (mean 26%). Image improvement (motion artifact reduction) obtained using the new constraint is compared with that obtained using a smoothness constraint based on the bending energy of the coordinate grid by blinded visual assessment of maximum intensity projections of subtraction images. For both constraints, volume preservation improves, and motion artifact correction worsens, as the weight of the constraint penalty term increases. For a given volume change of the contrast-enhancing lesions (2% of the original volume), the incompressibility constraint reduces motion artifacts ...

this article, we propose an algorithm for the automatic alignment of MRI volumes that relies on robust estimation to compute the alignment parameters. The robust estimation procedure automatically ignores those voxels (outliers) where the intensities are sufficiently different in the two volumes. The resulting method is capable of accurate alignment (better than 1 mm), even when a large percentage of the voxels (more than 20%) violate the intensity conservation assumption. The resulting procedures are used routinely in our laboratory in the analysis of fMRI data.