A complete distortion correction for MR images: II. Rectification of static-field inhomogeneities by similarity-based profile mapping

Similar documents
White Pixel Artifact. Caused by a noise spike during acquisition Spike in K-space <--> sinusoid in image space

Slide 1. Technical Aspects of Quality Control in Magnetic Resonance Imaging. Slide 2. Annual Compliance Testing. of MRI Systems.

A Model-Independent, Multi-Image Approach to MR Inhomogeneity Correction

Sources of Distortion in Functional MRI Data

Module 4. K-Space Symmetry. Review. K-Space Review. K-Space Symmetry. Partial or Fractional Echo. Half or Partial Fourier HASTE

(a Scrhon5 R2iwd b. P)jc%z 5. ivcr3. 1. I. ZOms Xn,s. 1E IDrAS boms. EE225E/BIOE265 Spring 2013 Principles of MRI. Assignment 8 Solutions

Functional MRI in Clinical Research and Practice Preprocessing

Lucy Phantom MR Grid Evaluation

Fmri Spatial Processing

Computational Algorithm for Estimating the Gradient Isocenter of an MRI Scanner

Sphere Extraction in MR Images with Application to Whole-Body MRI

SPM8 for Basic and Clinical Investigators. Preprocessing

SPM8 for Basic and Clinical Investigators. Preprocessing. fmri Preprocessing

Compressed Sensing Algorithm for Real-Time Doppler Ultrasound Image Reconstruction

ECSE 626 Project Report Multimodality Image Registration by Maximization of Mutual Information

Digital Volume Correlation for Materials Characterization

COBRE Scan Information

EPI Data Are Acquired Serially. EPI Data Are Acquired Serially 10/23/2011. Functional Connectivity Preprocessing. fmri Preprocessing

Basic fmri Design and Analysis. Preprocessing

New Technology Allows Multiple Image Contrasts in a Single Scan

Chapter 3 Set Redundancy in Magnetic Resonance Brain Images

Field Maps. 1 Field Map Acquisition. John Pauly. October 5, 2005

3-D Gradient Shimming

XI Signal-to-Noise (SNR)

Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging

MR IMAGE SEGMENTATION

A Virtual MR Scanner for Education

Role of Parallel Imaging in High Field Functional MRI

Breast MRI Accreditation Program Clinical Image Quality Guide

Lab Location: MRI, B2, Cardinal Carter Wing, St. Michael s Hospital, 30 Bond Street

Introduction to fmri. Pre-processing

Image Quality Assessment Techniques: An Overview

HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008

CORRECTION OF IMAGE DISTORTION IN ECHO PLANAR IMAGE SERIES USING PHASE AND INTENSITY. Ning Xu. Dissertation. Submitted to the Faculty of the

HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.

A Study of Medical Image Analysis System

Efficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest.

MRI Physics II: Gradients, Imaging

Motion Correction in fmri by Mapping Slice-to-Volume with Concurrent Field-Inhomogeneity Correction

Following on from the two previous chapters, which considered the model of the

Multi-modal Image Registration Using the Generalized Survival Exponential Entropy

Methodological progress in image registration for ventilation estimation, segmentation propagation and multi-modal fusion

Image Segmentation and Registration

An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy

MEDICAL IMAGE COMPUTING (CAP 5937) LECTURE 4: Pre-Processing Medical Images (II)

Histograms. h(r k ) = n k. p(r k )= n k /NM. Histogram: number of times intensity level rk appears in the image

CHAPTER 9: Magnetic Susceptibility Effects in High Field MRI

Robust Realignment of fmri Time Series Data

Towards an Estimation of Acoustic Impedance from Multiple Ultrasound Images

Super-Resolution Reconstruction of Diffusion-Weighted Images from Distortion Compensated Orthogonal Anisotropic Acquisitions.

Deviceless respiratory motion correction in PET imaging exploring the potential of novel data driven strategies

Phase Difference Reconstruction. Outline

Diffusion MRI Acquisition. Karla Miller FMRIB Centre, University of Oxford

Outlines. Medical Image Processing Using Transforms. 4. Transform in image space

Supplementary methods

MRI image formation 8/3/2016. Disclosure. Outlines. Chen Lin, PhD DABR 3. Indiana University School of Medicine and Indiana University Health

M R I Physics Course

The SIMRI project A versatile and interactive MRI simulator *

Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques

A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING

Use of MRI in Radiotherapy: Technical Consideration

A novel noise removal using homomorphic normalization for multi-echo knee MRI

REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT

3-D Compounding of B-Scan Ultrasound Images

HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2006

Classification of Abdominal Tissues by k-means Clustering for 3D Acoustic and Shear-Wave Modeling

ADNI, ADNI_QH, SURVEY. Geometry. connection

Weighted-CS for reconstruction of highly under-sampled dynamic MRI sequences

Parallel Imaging. Marcin.

CHAPTER 2. Morphometry on rodent brains. A.E.H. Scheenstra J. Dijkstra L. van der Weerd

surface Image reconstruction: 2D Fourier Transform

SIGMI Meeting ~Image Fusion~ Computer Graphics and Visualization Lab Image System Lab

Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov

A Radiometry Tolerant Method for Direct 3D/2D Registration of Computed Tomography Data to X-ray Images

Image Enhancement. Digital Image Processing, Pratt Chapter 10 (pages ) Part 1: pixel-based operations

Experiments with Edge Detection using One-dimensional Surface Fitting

Image Registration. Prof. Dr. Lucas Ferrari de Oliveira UFPR Informatics Department

2 Michael E. Leventon and Sarah F. F. Gibson a b c d Fig. 1. (a, b) Two MR scans of a person's knee. Both images have high resolution in-plane, but ha

BME I5000: Biomedical Imaging

Partial k-space Reconstruction

Performance Evaluation of the TINA Medical Image Segmentation Algorithm on Brainweb Simulated Images

Use of Shape Deformation to Seamlessly Stitch Historical Document Images

Partial k-space Recconstruction

Is deformable image registration a solved problem?

MRI Imaging Options. Frank R. Korosec, Ph.D. Departments of Radiology and Medical Physics University of Wisconsin Madison

Chapter 3 Image Registration. Chapter 3 Image Registration

3D VISUALIZATION OF SEGMENTED CRUCIATE LIGAMENTS 1. INTRODUCTION

Information about presenter

8/3/2017. Contour Assessment for Quality Assurance and Data Mining. Objective. Outline. Tom Purdie, PhD, MCCPM

82 REGISTRATION OF RETINOGRAPHIES

GRID WARPING IN TOTAL VARIATION IMAGE ENHANCEMENT METHODS. Andrey Nasonov, and Andrey Krylov

Data Term. Michael Bleyer LVA Stereo Vision

Basic principles of MR image analysis. Basic principles of MR image analysis. Basic principles of MR image analysis

maximum likelihood estimates. The performance of

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Constrained Reconstruction of Sparse Cardiac MR DTI Data

Fast Image Registration via Joint Gradient Maximization: Application to Multi-Modal Data

Automatic Parameter Optimization for De-noising MR Data

Transcription:

INSTITUTE OF PHYSICS PUBLISHING Phys. Med. Biol. 50 (2005) 2651 2661 PHYSICS IN MEDICINE AND BIOLOGY doi:10.1088/0031-9155/50/11/014 A complete distortion correction for MR images: II. Rectification of static-field inhomogeneities by similarity-based profile mapping Stefan A Reinsberg 1, Simon J Doran 2, Elizabeth M Charles-Edwards 1 and Martin O Leach 1 1 Cancer Research UK Clinical MR Research Group, Royal Marsden NHS Trust/ Institute of Cancer Research, Downs Rd, Sutton, SM2 5PT, UK 2 Department of Physics, University of Surrey, Guildford, GU2 7XH, UK E-mail: stefan.reinsberg@icr.ac.uk and martin.leach@icr.ac.uk Received 8 October 2004, in final form 31 March 2005 Published 18 May 2005 Online at stacks.iop.org/pmb/50/2651 Abstract Radiotherapy treatment planning relies on the use of geometrically correct images. This paper presents a fully automatic tool for correcting MR images for the effects of B 0 inhomogeneities. The post-processing method is based on the gradient-reversal technique of Chang and Fitzpatrick (1992 IEEE Trans. Med. Imaging 11 319 29) which combines two identical images acquired with a forward- and a reversed read gradient. This paper demonstrates how maximization of mutual information for registration of forward and reverse read gradient images allows the elimination of user interaction for the correction. Image quality is preserved to a degree not reported previously. 1. Introduction Inhomogeneities in the static magnetic field lead to geometric distortions within an MR image. This results from the reliance of accurate image reconstruction on the resonance frequency of a spin, which in turn depends solely on the strong (homogeneous) external field and the superposition of a (spatially linear) gradient. If a spin experiences a magnetic field that locally deviates from its expected value due to, e.g., differing material susceptibility, local shielding by the electron cloud, or shim imperfections of the static field, its spatial position will be represented incorrectly in the image. Among the various distortion correction techniques described in the literature the elegant correction procedure proposed by Chang and Fitzpatrick (1992) is particularly appealing as it does not require quantification or knowledge of the inhomogeneity. This method can be used for patient-induced field inhomogeneities. Furthermore, on initial inspection it appears to be a technique that can be simply implemented on any clinical scanner by alternately acquiring 0031-9155/05/112651+11$30.00 2005 IOP Publishing Ltd Printed in the UK 2651

2652 S A Reinsberg et al two images with opposite polarity of the read gradient. Simple as this approach may seem, it has not found its way into regular clinical use because of a number of practical issues that severely degrade the quality of the distortion-corrected images. The original post-processing correction proposed by Chang and Fitzpatrick (1992) consists of a two-stage procedure. Firstly, corresponding features in forward and reverse read gradient images are identified. Secondly, the corrected intensity at the average position of the identified corresponding features is calculated. It is the initial procedure of mapping the forward gradient image onto the reverse gradient image that is crucial for good image quality. Chang and Fitzpatrick (1992) and Kannengiesser et al (1999) both proposed schemes that worked well on phantoms and synthetically distorted images. Only Kannengiesser et al (1999) presented human images and, in these, correction in regions of low signal (e.g., sinus and other air cavities) failed. These are the regions that may be of particular interest for the planning of radiotherapy treatment of head-and-neck cancers, where susceptibility-based distortions might be expected. The previously proposed correction techniques will be described briefly, together with the reasons why they fail under certain conditions. Two new mapping schemes will be introduced with an emphasis on methodology improvement. Specifically, we will compare the following techniques: Runge Kutta integration/direct integration of the ordinary differential equation (ODE). Dynamic space warping as proposed by Kannengiesser et al (1999). Mapping based on cross correlation. Mapping based on mutual information. Examples of corrected images in the head and neck as well as in the pelvis will be given. The performance of different correction algorithms will be compared using image quality measures. 2. Method 2.1. Basic image recovery Since the fundamentals of the correction technique have been shown in detail by Chang and Fitzpatrick (1992) and Kannengiesser et al (1999), it will suffice to show how the corrected image is created once one has identified two matching points x 1 and x 2 along the gradient readout direction in the forward and reverse polarity gradient image, respectively: the true position of the pixel at position x 1 in the forward image and x 2 in the reverse image is given by x = x 1 + x 2. (1) 2 The pixel intensity, I(x), at position x can be derived under the condition that the integral image intensity has to remain constant. It is given by I(x) = 2I 1(x 1 )I 2 (x 2 ) I 1 (x 1 ) + I 2 (x 2 ), (2) where I 1 (x 1 ) and I 2 (x 2 ) signify intensities in the forward and the reverse gradient image. It is important to realize that the pixel intensities in the corrected image are calculated from the intensities in both forward and reverse gradient image taking into account the correspondence of position x 1 and x 2 in the forward and reverse image, respectively.

B 0 correction of MR images 2653 The correct identification of matching pairs (x 1,x 2 ) is the foundation of any successful rectification algorithm. Chang and Fitzpatrick (1992) showed that, in the absence of noise, any matching pair (x 1,x 2 ) will have to satisfy x1 x2 I 1 (x 1 ) dx 1 = I 2 (x 2 ) dx 2, (3) x 01 x 02 where x 01 and x 02 are the edges in the corresponding forward and reverse gradient images. Equation (3) can be harnessed in a multitude of ways for the task of mapping corresponding positions in forward and reverse polarity gradient images. Chang and Fitzpatrick (1992) used a fourth-order Runge Kutta integration of the differential form as well as a straightforward integration of equation (3). They did not find a difference in performance. Kannengiesser et al (1999) used an approach from speech recognition known as dynamic time warping. In its most general implementation, it is numerically equivalent to the Chang integration method. The introduction of conditions for the mapping process such as maximum pixel shift between forward and reverse gradient image, led to the algorithm becoming less susceptible to noiseinduced errors and providing an improvement in performance as reported by Kannengiesser et al (1999). 2.2. Similarity measures The approach described in this work maps image profiles according to their similarity at a local level and is inspired by image-registration techniques as used for matching multimodality images (Maes et al 1997, Hawkes 1998, Zitova and Flusser 2003). In comparison to our requirements, the previously published algorithms for image registration have a very different purpose: they are being used to account for physical motion/distortion between different images on a global scale (rigid-body) or on a local level (non-rigid body). The methods described in this paper correct for distortion down to a very localized scale (pixel) and along one dimension (read gradient direction). They might be described as a (very) non-rigid registration in one dimension. Furthermore, the reversal of read gradients leads to an altogether different registration problem. The rationale behind using a technique aimed at improving local similarity relies on the fact that in the absence of B 0 inhomogeneity, the intensity profiles associated with forward and reverse polarity read gradient should be identical. In reality, they will be only similar, not identical, because of noise and, for this reason, when the warping due to distortions is removed, this similarity should only approach but not reach identity. The aim is to construct a measure of similarity which can be used to gauge similarity of associated profile lines. Roche et al (1999) have outlined the methodology of registration processes given some knowledge about the relationship between corresponding intensities in two images. For instance, if the intensities are linearly related, cross-correlation is an appropriate similarity measure, or, if they are probabilistically related, mutual information should be chosen to measure similarity. We implemented both, mutual-information based registration as well as cross correlation and tested their respective performance. For two images acquired with forward and reverse polarity read gradients in the absence of B 0 inhomogeneities, intensities should be locally identical in the absence of noise. However, due to distortions, intensities will be changed depending on the compressing or stretching effect of the local distortion. Equation (2) shows how this effect can be removed by assuming an underlying conservation of summed total intensity in one profile. Two profiles (or images, or volumes) are best aligned if the amount of information shared between them is maximal. A common way of measuring information content in signals is the

2654 S A Reinsberg et al Shannon Wiener entropy measure, H.Ifi 1 and i 2 are the two intensity profiles along the read gradient direction x, one can calculate the mutual information, I(i 1, i 2 ), of the two profiles according to a proposal by Shannon (1948): I(i 1, i 2 ) = H(i 1 ) + H(i 2 ) H(i 1, i 2 ) (4) where H(i) is the Shannon-Wiener entropy measure for the intensity of profile i. It can be calculated according to H = k p k log(1/p k ), where p k is the relative frequency of intensity k occurring in profile i. Intensity values that occur very frequently convey a low amount of information while rare pixel intensities (0 <p k 1) carry a high information content. This is reflected in the entropy measure, H, with largest contributions from rare intensity values. Similarly, H(i 1, i 2 ) is the joint entropy based on the relative frequency, p kl, of an intensity k occurring at a location in profile i 1 while intensity l occurs in profile i 2 at the same location: H = k l p kl log(1/p kl ). In equation (4) the contribution from the separate image entropies (H(i 1 ) and H(i 2 )) does not depend on the image alignment assuming that the field of view fully encompasses the object or misalignments at the edge of field of view occur only to a very small extent within a very small fraction of the entire volume. Only the joint entropy H(i 1, i 2 ) will decrease if alignment is improved. Alignment will be improved if a certain pixel value will be associated mostly with the correct location in the second image ( aligned ) rather than with many pixel intensities at wrong locations ( misaligned ). In a 2D histogram this reduction in joint entropy leads to the sharpening of the features. For the estimation of entropies, the authors have employed histogram binning with ten different intensity values grouped per bin. Tests with different bin sizes showed no discernable difference in image quality. To accommodate the distortion along the read gradient direction, a mapping function, φ : x 1 x 2 = φ(x 1 ), can be constructed. This mapping function is a monotonic one-to-one mapping of x 1 x 2. Note the transition from single pixel positions, e.g. x 1, to a vector, e.g. x 1, describing the positions of all pixels in one profile. To accommodate the unwarping of profiles in the calculation of similarity in equation (4), i 2 needs to be substituted with i 2 (φ(x 1 )). The distortion will be optimally described by φ if the mutual information I(i 1, i 2 (φ(x 1 ))) is maximal. Instead of mutual information, cross correlation can be used (Roche et al (1999)). The similarity, S, to be maximized becomes: S = corr(i 1, i 2 (φ(x 1 ))) = Cov(i 1, i 2 (φ(x 1 ))) Var(i1 ) Var(i 2 (φ(x 1 ))), (5) where corr(a, B) is the normalized cross correlation measure between vectors A and B. Roche et al (1999) have defined S as the ratio between the images covariance (Cov()) and the product of individual standard deviations ( Var()). A third possible measure of similarity is the sum of squared differences: S = (i 1 i 2 (φ(x 1 ))) 2. (6) The rationale behind this choice is that, when the mapping function is optimal, one might expect this metric to be at a minimum, because the difference of the intensities will be equal simply to the noise level. The sum-of-squares metric has the advantage that it is faster to compute than the mutual information or cross-correlation. With the similarity measure established, the optimal mapping function can be found as follows: (i) Construct the initial mapping function. Usually, this is the 1:1 mapping of x 2 = φ(x 1 ) = x 1.

B 0 correction of MR images 2655 1.0 mutual information 0.8 0.7 0 100 200 400 iteration number Figure 1. Improvement of the similarity measure mutual information as a function of iteration for ten central profiles of the image displayed in figure 2. The algorithm described in section 2.2 only accepts changes in the mapping function if this result in an improvement in the similarity measure. (ii) Calculate the similarity function. This can be performed in the form of mutual information, cross correlation or sum of squared differences. (iii) Change the mapping function randomly, or, in a directed fashion. While the latter will be faster, a proof of principle can be achieved with a iteratively modified φ. For this, the mapping vector was recursively modified in decreasingly smaller sub blocks: initially, the entire mapping vector was shifted by one and two pixels in both directions. The shift producing the biggest improvement in the similarity function of step (ii) is accepted and the new mapping function is stored. (iv) Subsequently, the block size is reduced to half of the original block of pixels. In further iterations, the shifted vector length was reduced further and shifted by one or two pixel in either direction. This procedure ensures that global shifts of pixel groups are found quickly while distortions on a single-pixel scale are found at a later stage in the search algorithm. (v) Return to step (ii) until no further improvement in the similarity function can be achieved. Using equations (1) and (2), the corrected image can be calculated, where vectors x 1 and x 2 have been identified as described above. In the above algorithm, the proposed search for the mapping function in step (iii) is ad hoc. However, the mapping function will always improve during the search because only increases in the similarity function are permitted. Ultimately, the search was terminated when the moved sub-blocks consisting of a decreasing number of pixels reach the size of one pixel. Figure 1 shows the improvement of the mutual information as a function of iteration for ten profiles of the correction of the image presented in figure 2. The method does not guarantee to reach the globally optimal solution, something which could be achieved using a stochastic method such as simulated annealing. However, the improvements in comparison to the previous methods of rectification are already significant (see figures 3 and 4). Given the difficulties discussed below of measuring quantitatively the improvement to the images the by-eye assessment of the trained radiologist still appears to be the most useful, it is not clear to the authors that the extra processing time to achieve this is warranted. By contrast, a more directed optimization scheme, which would speed up the search for the best mapping function is a candidate for future development.

2656 S A Reinsberg et al (A) (B) Figure 2. (A) Sagittal slice of a 3D TFE scan with forward read gradient of a patient to be treated with radiotherapy. (B) Difference of forward and reverse read gradient image. Note the read gradient was applied in sup inf direction. Areas of particular mismatch (dark or bright rather than grey) are near the skull and the region of the sinus and other air cavities. 2.3. Image acquisition and processing When implementing the acquisition with gradient reversal, it was found that an interleaved acquisition (e.g. reversal of read gradient polarity) is a requirement to avoid patient motion artefacts. The correction algorithm fails if there is a difference in the two images due to motion, particularly in the case of through-slice motion. Obviously, there is a choice of how many lines of k-space with the same read gradient polarity can be grouped into one interleaved block. The more lines grouped, the more likely the possibility of motion between forward and reverse read gradient polarity images. Equally, image contrast and signal-to-noise ratio needs to be identical. If a saturation slab is excited prior to the acquisition of twice the amount of k-space data (i.e. an alternate forward and reverse polarity read gradient), the result will be a reverse gradient polarity image with less efficient signal suppression. Spoiler pulses in short- T r steady-state incoherent sequences have to be applied after each signal acquisition to avoid signal interference at the outset of a new k-space line preparation. It was found that these pulses have to be increased in length and strength to counter the effect of reversed magnetization evolution due to reversed read gradient polarity. These prolonged spoiler gradient pulses might necessitate longer repetition times, T r. To avoid the change in contrast, alternating read gradient polarity after all the lines of k-space within a repetition time period have been acquired (a shot ) seems a reasonable compromise. For head and neck imaging, the imaging sequence used was a 3D T 1 -weighted spoiled gradient-echo with interleaved reversal of the read gradient. The parameters used were: FoV 230 mm (100%), matrix 256 256 (100%), 200 slices, isotropic voxel 0.9 3 mm 3,T r /T e (ms) = 9.7/3.7. Contrast enhancement was achieved using an inversion pulse prior to 256 shots each with α = 12. The acquisition bandwidth per pixel was 192.5 Hz resulting in a fat water shift of 1.1 pixels. The second imaging technique, for pelvic imaging, was a 3D T 2 -weighted turbo spin echo with interleaved read gradient reversal. The experimental parameters were: FoV 400 mm (75%), matrix 256 256 (70% scan percentage), 60 80 slices (depending on patient anatomy), thickness 2.5 mm, and T e /T r (ms) = 1500/120. The acquisition bandwidth per pixel was 476.4 Hz resulting in a fat water shift of 0.5 pixels. The scanner used was a 1.5 T Philips Intera R 9.1. Informed written consent was obtained from patient volunteers.

B 0 correction of MR images 2657 (A) (E) (I) (N) (B) (F) (K) (O) (C) (G) (L) (P) (D) (H) (M) (Q) 2.4. Image post-processing Figure 3. Comparison of corrected images: (A) implementation of integration method, (B) dynamic space warping as proposed by Kannengiesser et al (1999), (C) cross-correlationbased registration and (D) mutual-information-based registration. Subtraction of (A) through (D) from the original forward-polarity read gradient image (figure 2(A)) is shown in images (E) (H). Image quality maps are shown in images (I) (M) (MSE) and (N) (Q) (SSI). Note that for the comparison of identical images the MSE image will be black whereas the SSI image will be entirely white. Images were post-processed off line using IDL 5.6 and 6.0 (Interactive Data Language, Bolder, Colorado). A SUN Sparc Ultra-4 and a Dell Inspiron 8200 running Mandrake Linux have been used. Average times for correcting an image of 256 256 pixels are about 10 min for the mutual-information based correction method and less than 30 s for any of the other methods. 3. Results As shown by Chang and Fitzpatrick (1992) as well as Kannengiesser et al (1999), the previously presented correction technique can be successfully applied to phantoms. Image quality of the

2658 S A Reinsberg et al (A) (B) (C) (D) (E) (F) Figure 4. Corrected images for pelvic image to be used for radiotherapy planning. (A) Forward read gradient image, (B) difference image between forward and reverse read gradient image, (C) correction after dynamic space warping method as proposed by Kannengiesser et al (1999), (D) corrected image using mutual information registration, (E) difference image (A) (C), (F) difference image (A) (D). corrected phantom images is near the original image except for the removal of the distortion observed in the original images. The work presented here aims to overcome the difficulties of any of the discussed correction algorithms that become apparent when MR images of humans need to be corrected: contrast patterns are more intricate and the chemical shift artefact of neighbouring fat and muscle compartments is inadequately modelled by simple oil and water phantoms, where the compartments are usually separated in space by well-defined Perspex walls. Signal-to-noise ratios are usually higher in phantoms compared to human subjects further complicating application of correction algorithms in vivo. Figure 2 shows a typical result for a T 1 -weighted scan of a patient with a skull-based tumour. The difference image between forward and reverse read gradients in figure 2(B) shows the mismatch due to a combination of B 0 inhomogeneity, chemical shift and susceptibility artefacts. Effects of motion are minimized by the use of interleaved alternating polarity gradients. Note that the read gradient direction is running cranio-caudially. The mismatch is particularly evident in the region with adjacent bone and air cavities (sinuses, nasopharynx). In figure 3, a comparison between different correction techniques can be seen. In all cases, pairs of forward and reverse-polarity gradient intensity profiles have been registered separately. No smoothing between or within the registered profiles has been applied. While all four techniques recover the gross anatomy, serious shortcomings can be seen in figures 3(A) (C) (see arrows). Although the structures in the brain are well recovered by all four techniques, regions such as the sinuses exhibit a degradation of image quality as shown in figure 3(A) through 3(C). These areas are more challenging for the distortion correction than comparatively homogeneous brain tissue because susceptibility mismatches and chemical shift artefacts (muscle near fat) are dominant. In contrast, the mutual information registration based correction shows a superior result in regions of these sharp changes of signal intensity. These edges associated with a change in signal intensity (arrow) are quite

B 0 correction of MR images 2659 Table 1. Image quality parameters MSE (equation (7)) and SSI (equation (8)) for four different correction algorithms averaged over a region encompassing the entire head and neck. MSE SSI Mutual information 0.19 0.67 Cross correlation 0.23 0.58 Dynamic-space warping 0.24 0.57 Direct integration 0.26 0.53 jagged for the integration method but slightly better tolerated by the dynamic space warping method. To quantify the quality of the images after the image recovery, two image quality measures have been implemented. Judging image quality if the ideal image ( ground truth ) is not available is, of course, very difficult. However, from figures 3(A) (D), it is apparent that artefacts akin to noise, in particular, can be blamed for the decreasing image quality. Furthermore, since distortions are a few pixels at most, it seems reasonable to compare the corrected image to the original forward-polarity read gradient image although one does not expect the perfectly corrected image to be identical to it. Specifically, the forward-polarity image and the ideal image should be similar in terms of noise. An image quality index based on the mean squared error (MSE) between the forward-gradient and rectified images should show an increase for images with an increasing amount of artefacts similar to noise. For comparison purposes, one can scale the mean squared error to the error of an image of white noise (uniformly random distribution of pixel values). The following expression gives the MSE normalized to the error of white noise: i MSE = (t i o i ) 2 i (n i o i ), (7) 2 where t i,o i and n i are the ith pixel value for the tested image, the original image (forwardpolarity read gradient) and the white-noise image, respectively. A complementary approach has been proposed by Wang and Bovik (2002). Their structural-similarity index is designed to measure structural distortion by combining loss of correlation, mean distortion and variance distortion on a local level. Let o ={o i i = 1, 2,...,N} be the original forward-polarity read gradient image and t ={t i i = 1, 2,...,N} be the tested (distortion-corrected) image. The index is defined as SSI = ( σ 2 t 2σ to tō ) + σo 2 ( t 2 + ō 2 ), (8) N i=1 o i,σ t = 1 N N 1 i=1 (t i t) 2,σ o = 1 N N 1 i=1 (o i ō) 2, where t = 1 N N i=1 t i, ō = 1 N and σ to = 1 N N 1 i=1 (t i t)(o i ō). The dynamic range of the structural-similarity index is [ 1,1] with the best achievable value 1. The structural-similarity index has been applied to the images using a sliding window of 8 8 pixels and averaged over a region encompassing all of the head and neck as seen in figure 2(A). Table 1 summarizes the results from these two quality indices. It can be seen that the MSE is the lowest and the SSI the highest for the mutual-information based correction technique followed by the cross-correlation technique. The values for the MSE and SSI index are difficult to rationalize in absolute terms because the ideal case (MSE = 0 and SSI = 1) cannot be achieved as long as the comparison to the original forward-polarity read gradient image (o ={o i i = 1, 2,...,N}) is being made. However, one can assume that the deviation from the ideal case is a composite effect of the introduction

2660 S A Reinsberg et al of noise by the correction techniques and the true difference of the ideal (unknown) corrected image and the original forward-polarity read gradient image. If the major difference of the techniques is the varying degree to which noise artefacts are introduced, then clearly a minimal MSE or maximal SSI, respectively, will characterize the best correction technique. Figure 4 is a demonstration of the performance of the mutual information-based technique in different anatomical site and with a different contrast mechanism: T 2 weighting in a TSE sequence. The dynamic space warping technique (figure 4(C)) introduces white artefactual lines in regions of low signal intensity such as around the femoral head (arrows). The artefacts are reminiscent of an edge enhancement filter. These artefacts are not seen in figure 4(D) which has been calculated using mutual information based correction. The image quality of the corrected scan is comparable to the original image but is free from distortion caused by perturbations in the magnetic field strength. 4. Discussion and conclusion The results presented here show that results of the distortion-correction technique proposed by Chang and Fitzpatrick (1992) can be improved if a new method for the mapping of the pixel locations in forward and reverse read gradient polarity images is applied. The comparison of correction techniques showed that the best results were achieved using a mutual informationbased approach. Similarity measurements using the sum of squares were found to produce corrected images of comparable quality to that achieved using a mutual-information based similarity measurement in data sets tested (results not shown). Furthermore, the use of mutual information maximization for the mapping of profiles, offers the opportunity to use a group of neighbouring profiles for the establishment of the local mapping, although in the examples shown profiles have only been registered separately. While mapping several profiles simultaneously could prove advantageous in the case of noisier images, the construction of the mapping function must fulfil the following conditions: it must be flexible enough to accommodate location shifts on a pixel scale while maintaining the statistical advantage of using more than one profile. For our signal-to-noise ratios, image quality did not improve when three or five profiles were used. Conceivably, images with lower signal-to-noise ratios could benefit from this approach. One interesting feature of the mutual information-based distortion correction is its ability to cope to some degree with chemical shift artefacts. One of the conditions required by the Chang and Fitzpatrick method is the absence of discontinuous distortions such as those introduced by chemical-shift artefacts. However, this requirement can be relaxed if the distortions occur in the vicinity of dark signal regions (e.g. bright fat in dark muscle). While all algorithms can correct for static B 0 (shim-based) inhomogeneities, the presented mutual information based method performs better for chemical shift artefacts than either the original Chang and Fitzpatrick approach or the dynamic-space-warping correction. The original methods introduce an edge ringing similar to the effect observed in figure 4(C) around the femoral heads. This occurred when pixels containing fat were shifted onto pixels containing water. Pixel intensities were thereby added or void pixels occurred in profiles encoded by forward or reverse read gradients. The original method corrected the images by introducing ripples around the original edge while the mutual information-based method produces an edge located in the average position between the forward and reverse read gradient image. One has to keep in mind that this is only true for conventional images. Chemical shift artefact as observed in EPI is still too large to be corrected by the presented method. As emphasized in the preceding article in this series by Doran et al (2005), B 0 inhomogeneities in the form of chemical shift, or susceptibility differences are only one

B 0 correction of MR images 2661 source of image distortions. To deliver images with the geometric accuracy needed for radiotherapy treatment planning, one must also correct for distortions originating from gradient nonlinearities. Using prior knowledge of these distortions for a particular imaging sequence, one can correct for gradient-based distortions in addition to the removal of B 0 -induced distortions using the procedure proposed above. Acknowledgments Financial support from Cancer Research UK [CUK] (C1060/A808/G7643) and the Department of Health (NEAT grant B132) is acknowledged. References Chang H and Fitzpatrick J M 1992 IEEE Trans. Med. Imaging 11 319 29 Doran S J, Charles-Edwards E M, Reinsberg S A and Leach M O 2005 Phys. Med. Biol. 50 1343 61 Hawkes D J 1998 J. Anat. 193 347 61 Kannengiesser S A R, Wang Y and Haacke E M 1999 Magn. Reson. Med. 42 585 90 Maes F, Collignon A, Vandermeulen D, Marchal G and Suetens P 1997 IEEE Trans. Med. Imaging 16 187 98 Roche A, Malandain G, Ayache N and Prima S 1999 Proc. MICCAI 99 (Lecture Notes in Computer Science vol 1679) pp 555 66 Shannon C E 1948 Bell Syst. Tech. J. 27 379 423 and 623 56 Wang Z and Bovik A C 2002 IEEE Signal Process. Lett. 9 81 4 Wang Z, Bovik A C, Sheikh H R and Simoncelli E P 2004 IEEE Trans. Image Process. 13 600 12 Zitova B and Flusser J 2003 Image Vis. Comput. 21 977 1000