applications such as characterizing anatomical variability , monitoring changes due to disease or aging , and surgical planning have created the continuing need for research and development in registration [ 14 ] . the goal of medical image registration is to spatially align images so that they can be compared visually or quantitatively . in order for this alignment to be accurate
, one must both identify correct anatomical correspondences between subjects and generate appropriate coordinate transformations that best align these correspondences .
these are the central issues in deformable image registration and are the main focus of this paper .             deformable image registration has been approached in different ways ( cf . [ 523 ] ) , and the algorithms can be divided into two main classes : intensity - based [ 59 ] and feature - based metheods [ 12 , 17 , 2123 ] .
these methods are usually specialized for aligning same - modality images of a particular body part  for example , brain , breast , or heart .
automation is a key challenge since the algorithm must identify homologous landmarks or risk very large registration errors .
intensity - based methods , on the other hand , use dense subsets of image intensities to align images .
the most popular and successful intensity - based methods to date use mutual information - based similarity criteria .
these algorithms are usually fast and fully automated and are very generic in that they are not limited to one particular body part or a single modality . however , the landmarks that are implied by these methods are not primarily based on anatomical homology , which can lead to erroneous deformations .           a few methods that combine these two approaches
hammer   combines intensity - based and feature - based registration by introducing two key concepts : attribute vectors and driving voxels .
information about both the image intensity and derived image features are concatenated into an attribute vector , which is defined for every voxel in both the template image and the subject image .
hammer 's driving voxels are hierarchically selected voxels that represent strong , reliable features that are to be aligned first .
this process reduces the number of suboptimal correspondences in the beginning of the registration process .
the blending of both intensity - based and feature - based strategies puts hammer at the forefront of deformable registration algorithms today and is the main reason why we chose to use a similar framework for our algorithm .          despite its strengths , there are three components in hammer where significant improvements can be made .
first , hammer computes its attribute vectors exclusively from a hard segmentation of the mr images .
the hard segmentation is a strict classification of the image into three discrete classes , which correspond to the three main tissue types of the human brain , that is , the white matter ( wm ) , gray matter ( gm ) , and cerebrospinal fluid ( csf ) .
given hammer 's attribute vectors and similarity criteria , this segmentation needs to be extremely consistent between subjects in order for the algorithm to be robust in identifying homologous anatomical landmarks .
second , because of hammer 's exclusive use of a hard segmentation , it requires extra preprocessing of the images  a time consuming step  wherein the ventricles of the brain are segmented and used ( essentially ) as a fourth tissue class .
third , hammer 's strategy to interpolate landmark correspondences in order to generate a dense displacement field is to apply nonoverlapping gaussian kernels and use uniform smoothing throughout the entire image , that is , both on the highly convoluted brain cortex as well as in the more uniform structures of the subcortical white matter .
this approach prevents the algorithm from capturing high - curvature and high - resolution details when registering the folding patterns  that is , sulci and gyri  of the brain cortex .                in this paper , we address these three limitations of hammer in a new algorithm that we call mjolnir .
( the name choice was motivated by our goal to create a  better hammer  ; mjolnir was the name of the hammer of the norse god thor , arguably one of the most powerful hammers ever  made  . )
the main technical contribution of the paper is a novel , fast interpolation of the displacement field defined from sparse landmarks during the registration process ( section 4 ) .
we use a diffusion transformation model , which does not smooth the displacement field uniformly throughout the image but takes into account derived information about the quality of landmark correspondences and weights the smoothing based on the anatomical features being aligned .
mjolnir was extensively evaluated using the nirep ( non - rigid image registration evaluation project [ 27 , 28 ] ) evaluation database and its performance compared to the publicly available hammer software .
significant improvements are evident in nearly all comparative measures that are computed and are most strikingly evident in the cortex of the brain , which is a very difficult structure to register across subjects because of its high variability in the general population .
the mjolnir software will be made publicly available on http://iacl.ece.jhu.edu/ upon publication of this paper .
in this section , we focus on the two major areas of improvement that mjolnir claims over hammer : ( 1 ) improved preprocessing procedures and ( 2 ) a novel transformation model that interpolates sparse landmarks in order to generate a dense displacement field .
to provide context for these improvements , we first briefly describe mjolnir 's major processing concepts , which are graphically illustrated using the flowchart in figure 1 .
elements of mjolnir that are different from hammer are marked with * in the figure .
for further details about those processing steps that are in common with hammer , the reader is referred to the main hammer publication .
an attribute vector a(x ) is defined as the concatenation of specific regional image features that are computed within a small spherical neighborhood centered at x. there are three key parts of mjolnir 's attribute vector a(x ) = ( a1(x ) , a2(x ) , a3(x ) ) , which are together used to measure image similarity during the registration process .
the first part a1 is an integer that represents the edge type of the voxel based on a hard segmentation of the mr brain image into three classes , corresponding to the three main tissue types of the human brain : white matter ( wm ) , gray matter ( gm ) , and cerebrospinal fluid ( csf ) .
the edge type takes one of seven values , one value for voxels that are not adjacent to an edge and six distinct values for voxels that are located on edges between wm , gm , and csf .               
the second part a2 of mjolnir 's attribute vector is the intensity of a histogram - equalized version of the original mr image , normalized between zero and one over the image domain ( see the rationale for histogram equalization in section 3 ) .
a good registration will yield strong similarities in both edge type a1 and normalized intensity a2 when the images are aligned .
the third part a3 of mjolnir 's attribute vector is a vector of normalized geometric moment invariants ( gmis ) .
several gmis , which yield measures of the  intensity shape  around each voxel , are computed based on segmented mr images at a small neighborhood around each voxel of each image . as in hammer
these are voxels with distinctive attribute vectors ( in either image ) that can be associated with similar points in the other image , creating temporary landmark pairs that  drive  the deformation of one image toward the other .
driving voxels are  active  points while all other voxels are  passive ,  because the overall displacement field at any given iteration is determined entirely from the implied displacements of the driving voxels .                                            driving
voxels are automatically selected in a hierarchical fashion , starting with a small initial set of highly distinctive voxels in both the subject and template images .
voxels with attribute vectors that are similar  as measured by the similarity function defined in   ( 1 ) below  to very few other places in the brain are deemed to be  highly distinctive . 
the original hammer publication   demonstrated that voxels on sulcal fundi and gyral crowns are distinctive by this criterion .
these primary driving voxels initialize the registration algorithm ; in later iterations , the driving voxels in the template image are gradually augmented by adding an increasing number of ( increasingly less ) distinctive points in the neighborhood of each primary driving voxel . in each iteration ,
the subject image is deformed relative to the template image , and new driving voxels are identified in order to continue to bring the images into alignment .
various thresholds are changed throughout the registration process such that all voxels in the template image eventually become driving voxels . for computational savings ,
the driving voxels in the subject image are never augmented to include more than just the primary driving voxels . for each driving voxel in the subject and template images , a corresponding voxel in the other image
the quality of a match is based on voxel similarity , which is defined for two voxels xs and xt using their attribute vectors as follows : 
 ( 1)s(xs , xt)=(a1(xs)a1(xt))(1|a2(xs)a2(xt)|)i=19(1|a3i(xs)a3i(xt)| ) ; 
							 where ( ) is the discrete delta function .
the range of similarity is [ 0 , 1 ] where unity means perfect similarity .                                                  after searching and finding correspondences for all driving voxels , displacement vectors pointing from the template to the subject
are formed for each driving voxel , forming a sparse displacement field uc in the domain of the template .
this field must be interpolated and smoothed throughout the entire image domain in order to generate a dense displacement field ( see section 4 ) , which yields a transformation that can be used to align the two images by warping their coordinate systems .
mjolnir is run on three resolutions from coarse to fine ( see figure 1 ) . by careful control of the parameters of the process
 for example , size of search windows and growth rate of the number of driving voxels , ( see table 1)the images are brought into alignment . as in hammer
, the overall process can be thought of as one that combines landmark alignment through selection of the driving voxels with intensity - based alignment through use of attribute vector similarity . in the following sections we describe the parts of mjolnir that have been substantially improved over hammer .
before running mjolnir , a sequence of preprocessing steps must be applied to the raw mr images ( see the top box in figure 1 ) .
mjolnir is specifically tuned for spgr ( spoiled gradient recalled ) t1-weighted mr images of the human brain with the following parameters : te = 52 ms , tr = 35 ms , fov = 24 cm , flip angle = 45 degrees , slice thickness = 1.5 mm , gap = 0 , matrix = 256  256 , nex = 1 .
use of alternate contrasts may require the use of a different classification algorithm and some changes to the attribute vector , the similarity measure , and thresholds on similarity .
once these changes are made , the rest of mjolnir should work without modification .                 
the preprocessing steps include skull - stripping , resampling , histogram equalization , and tissue classification ( i.e. , segmentation ) . resampling yields cubic voxels , which reduces the directional dependency in subsequent processing .
we do not discuss skull - stripping and resampling herein , as these are carried out in a conventional manner ( cf . [ 31 , 32 ] ) .
however , our use of histogram equalization and the specific implementation and use of tissue classification is novel and important , so we briefly describe them below .
mr image intensities between subjects can be quite variable , even for the same pulse sequence and the same scanner .
differences may be caused by pulse sequence variations , intensity inhomogeneities , flow artifacts , scanner gain differences , and motion ghosting .
this in turn can cause the hard segmentation of mr images to be very inconsistent between different scans .
inconsistencies between subjects are particularly evident on the brain cortex , as demonstrated in figure 2 .
the highlighted sulci on these segmented images , which should be homologous and therefore registered to each other , are inconsistent in appearance ; in particular , the csf appears to be split in one subject but not the other .
because of this inconsistency , hammer 's exclusive reliance on hard segmentations can cause registration errors .
mjolnir addresses this problem both by using histogram equalization and by incorporating the soft segmentations into the attribute vectors .   in mjolnir , we use histogram equalization   of both images in order to create a more exact match between the intensities of the two images and to create sulcal features that are typically quite subtle in the original mr images .
this procedure reduces differences and inconsistencies between different subject scans as well as increasing the intensity contrast between tissue classes , thereby improving their ability to define distinctive landmarks . in particular
, we have noticed that histogram equalization yields hard segmentations that are more revealing of tissue class boundaries that are consistently defined across different subjects .
this property is illustrated in figure 3 . in this example , regions of sulcal csf are arbitrarily disconnected in the hard segmentation of the original image , whereas the csf within sulci is largely connected when the histogram equalized image is used . this tends to increase the consistency of the csf class between different subjects .
a specific example on improved consistency between different subjects is shown in figure 4 .   in both mjolnir and hammer , skull - stripped and isotropically resampled images are classified into white matter ( wm ) , gray matter ( gm ) , and cerebrospinal fluid ( csf ) using fantasm [ 34 , 35 ] .
this algorithm compensates for intensity inhomogeneities while simultaneously generating three membership functions for wm , gm , and csf ( see figures 5(a)5(c ) ) , representing a  fuzzy  or  soft  classification .
classification is created by assigning each voxel to the class having the highest membership value for that voxel .
the segmentation result is used by both mjolnir and hammer as the primary basis of their attribute vectors and therefore has a very significant influence on the accuracy of the final result .
while hammer uses only the hard segmentation , mjolnir uses the soft segmentation as well .                        
mjolnir computes geometric moments on the membership functions rather than the hard classifications as in hammer .
in addition , mjolnir incorporates the histogram equalized mr intensity values into its attribute vector whereas hammer uses the hard segmentation values instead .
it is our observation that these two changes tend to yield more distinctive features throughout the brain , which provides better alignment during registration .
we believe that these changes are the main reason why mjolnir provides excellent alignment of the ventricles ( see section 5 ) without using a separate ventricle segmentation process as is done in hammer .
after preprocessing , driving voxels and their correspondences are found as previously described ( see also flowchart in figure 1 ) .
the resulting displacement vectors are generally sparse ( except in the final iterations ) and of varying reliability ( as measured by their relative computed similarities ( see ( 1 ) ) . in order to compute a dense coordinate transformation
, these data must be interpolated throughout the entire image , and the stronger matches should maintain more influence on the resulting dense displacement field .               
hammer uses nonoverlapping gaussian kernels applied to discrete subvolumes around each driving voxel in order to provide an initial dense displacement field . this field
is then modified by both global and local affine transformations and then globally smoothed to remove discontinuities that are introduced on the boundary of each deformed subvolume .
this process may oversmooth the displacement vectors corresponding to highly similar landmark voxels and may also leave evidence of the discontinuities at the edges of the supports of the gaussian kernels .                numerous interpolation methods have been proposed for interpolation of scattered data .
some have been used in deformable image registration ; however , literature is not so abundant when it comes to the interpolation of vector fields , which is required in our case .
used a free form deformation ( ffd ) model based on b - splines that deforms the image by manipulating an underlying mesh of uniformly spaced control points .
a key advantage of b - splines is that they have local control such that changing a control point affects the transformation only in the local neighborhood of that point .
this also makes b - splines computationally efficient ; however , large numbers of control points are required in order to capture the fine details of cortical registration , and this greatly increases the computational complexity .
thin - plate splines have also been used to provide coordinate system transformations in registration . since these are not local models , computational complexity is prohibitive for all but relatively low - order ( smooth ) transformations .
kriging is another widely used technique for spatial interpolation from sparse data , and although local neighborhood kriging has been proposed , it remains computationally prohibitive for large numbers of observed points .
mjolnir 's strategy starts with a relatively sparse interpolation problem , and for this phase the above approaches could be used .
but as mjolnir concludes its registration process , the numbers of observed displacements eventually equals the total number of voxels in the image volume , which is not computationally feasible for these existing interpolation and smoothing algorithms .
we clearly need a computationally feasible interpolation strategy that will work for vector fields , provides a smoothed interpolation ( not an exact fit ) , and works for both scattered and dense observations .                                             
it features all the properties mentioned above , in addition to providing for variable weights based on reliability .
the first requirement for the dense displacement field u is that it follows the displacement vectors of the sparse displacement field uc that were derived from the landmark pairs , since these displacement vectors represent correspondences that have been carefully evaluated .
the second requirement is that the displacement field is smooth across the entire image . in order to satisfy these requirements
, we define the dense displacement field to be the vector field u(x ) that minimizes the following energy functional ; 
 ( 2)e(u(x))=12  g|u(x)|2+p(x)|u(x)uc(x)|2dx , 
					 where  is the gradient operator .
the first term in the integrand of ( 2 ) encourages a smooth displacement field while the second term encourages the resultant field to agree with the established landmark displacement vectors .
we now describe the selection of the two weights , g and p(x ) .                   
the computed displacement field should agree with the landmark displacement vectors when they are accurate .
accordingly , p(x ) is defined as 
 ( 3)p(xt)={2s(xs , xt),if  xt  is  a  template  driving  voxel  located  on  an  edge , s(xs , xt),if  xt  is  a  template  driving  voxelnot  located  on  an  edge,0,otherwise , 
					 where s(xs , xt ) is the similarity function defined in ( 1 ) . with this definition , landmarks that are very similar  that is ,
those that are located on edges are given twice the weight since it is highly desirable to align edges .                   
the spatially constant weight g in ( 2 ) controls the tradeoff between smoothness and data fidelity .
it is set to be large in the beginning of the registration process when uc is sparse and then to become smaller in later iterations . in this way
, the spatial influence of each landmark is large in the beginning and becomes smaller as the density of driving voxels increases .
the effects of the regularization parameter g are demonstrated in 2d in figure 6 .                 
this approach to displacement vector interpolation provides a more principled interpolation than the approach of hammer .
the displacement field will be smooth wherever there are few strong features , such as white matter regions , yet will enable intricate displacement fields where there are many strong features , such as the gray matter cortex . both qualitative and quantitative benefits of using this displacement field interpolation over that used in hammer are demonstrated in section 5.1 .                  the euler - lagrange equation corresponding to ( 2 ) is given by 
						 ( 4)g2up(uuc)=0 . 
					
we solve this equation using a fast and efficient multigrid approach   as described in   ( which solves this same equation for the computation of gradient vector flow ( cf .
this equation can also be solved by gradient descent , leading to the gradient flow 
						 ( 5)ut = g2up(uuc ) , 
					 whose equilibrium state is the desired solution .                
the iterative process shown in the bold box of figure 1 is deemed to be complete when either the maximum difference between the current computed dense displacement field u and that of the previous iteration u differs in length by less than one voxel or when a preset maximum number of iterations has been achieved . upon completion of this iterative process at low resolution
, the iterative process is repeated at medium and then high resolutions , upsampling and deforming the subject data between each resolution .
mjolnir finishes by deforming the subject image using the dense field computed upon convergence of the iterative process at the highest resolution ( see figure 1 ) .
in the past , evaluating the performance of deformable registration algorithms has been accomplished through use of simulated deformation fields , demonstration of average images in atlas space , and comparison with small numbers of manually selected landmarks [ 4145 ] . with the advent of the non - rigid image registration evaluation project ( nirep ) [ 27 , 28 ]
, it is now possible to additionally evaluate the performance of a deformable registration algorithm through its ability to transfer labels between images .
the nirep na0 database comprises 16 richly annotated 3d t1-weighted spgr mr brain images corresponding to eight males and eight females , all normal adults .
the 16 datasets have been manually segmented into 32 gray matter regions of interest , including the frontal , parietal , temporal , and occipital lobes , the cingulate gyrus and insula .                    in particular , both mjolnir and hammer were used to register 15 of the nirep subjects to a randomly selected  template image  , and the deformed labels were then compared to the corresponding labels of the chosen template .
the average dice coefficient for each template label and for each algorithm was then computed , where dice coefficient is defined as 
						 ( 6)d(s1,s2)=2|s1s2|(|s1|+|s2| ) , 
					 where s1 and s2 are two labeled regions , and |s| is the number of voxels in s. this measure gives a quantitative evaluation of the algorithm 's performance in aligning anatomical structures . in our analysis of the overlap measure we used the paired t - test   to determine if the difference in average dice coefficient between mjolnir and hammer was statistically significant .
we did the hypothesis testing on each region 's difference of the mean in the following way .
the average dice coefficient for each of the 32 cortical regions for both algorithms was computed , yielding 32 pairs of data ( xi , yi ) , i = 1 ,  , 32 , where xi is the average dice coefficient for mjolnir , and yi is the average dice coefficient for hammer .
since each of the cortical regions are inherently different , we can not treat x1 ,  , x32 and y1 , 
we constructed wi = xi  yi , i = 1 ,  , 32 and tested the hypothesis of no improvements in registration accuracy by testing h0 : x  y
= 0 versus h1 : x  y  0 , where h0 is our null hypothesis .
if the p - value for the null hypothesis is less than .05 , our hypothesis that there is no difference in average dice coefficient between mjolnir and hammer is rejected ; hence , we can conclude that the difference in dice coefficient is statistically significant .
in the following experiments we compared the performance of mjolnir with the publicly available hammer program : hammer version1.0 @ sbia . our aim was to demonstrate the benefits of our extensions to the hammer algorithm and their effects on registration accuracy , and the experiments were designed with that in mind .
all the experiments were performed by us using the default parameter values of hammer , and we chose the same parameter values for mjolnir ( see table 1 ) .
the performance of the two algorithms was tested on the nirep evaluation database http://www.nirep.org/ , which , at the time of testing , was 
unseen  data to both of the algorithms to prevent any bias of favoring one algorithm over the other ; that is mjolnir was not specifically  tuned  for this dataset in any way prior to carrying out the analyses presented below .
the efficacy of the three major differences between mjolnir and hammer was evaluated using the nirep data .
we ran mjolnir with and without histogram equalization first to measure directly the benefits of including histogram equalization in the preprocessing routine .
the average dice coefficient was computed to measure the overlap between corresponding regions of all subjects after registration .
the registration accuracy was improved in 25 out of the 32 labeled regions of the brain when using histogram equalization first , as shown in figure 7 .
( sd ) of 0.0614 when mjolnir was run without the histogram equalization first and 0.6804 with sd of 0.0617 when histogram equalization was included in the preprocessing routine
. statistical analysis of these results using the paired t - test indicate that this difference is statistically significant ( p = 4.04  10 ) .
we modified mjolnir to use only a hard segmentation in its attribute vector ( as in hammer ) so that a measure of the benefit of using a soft segmentation and histogram equalized mr intensities could be evaluated directly .
histogram equalization was used in the preprocessing steps to make sure that the edge type element a1(x ) in the attribute vector was the same in both versions of mjolnir used in this experiment .
the average dice coefficient was computed to measure the overlap between corresponding regions of all subjects after registration .
the mean value was 0.6615 with sd of 0.0593 when using hammer 's attribute vector and 0.6804 with sd of 0.0617 when using mjolnir 's attribute vector .
statistical analysis of these results using the paired t - test indicate that significant improvements in registration accuracy of all cortical regions were seen when using mjolnir 's full attribute vector ( p = 2.94  10 ) . to demonstrate the benefits of mjolnir 's displacement field interpolation , we modified mjolnir to use hammer 's attribute vector in the following way : ( 1 ) we used the hard segmentation instead of the histogram equalized mr intensity for the intensity element a2(x ) , and ( 2 ) we computed the gmi 's in a3(x ) based on the hard segmentation instead of the soft segmentation .
therefore , the dominant difference between this modified version of mjolnir and hammer was the displacement field interpolation strategy , although the two algorithms differed in their preprocessing steps as well .
as in the previous experiment , we registered 15 subjects to a 16th template image ; results are shown in figure 9 .   it is observed from figure 9 that mjolnir 's interpolation strategy yields better alignment in 23 out of 32 structures . the average dice coefficient over all regions ( top row ) is larger in mjolnir , measuring 0.6416 with sd of 0.0789 when using hammer 's interpolation approach and 0.6615 with sd of 0.0325 when using mjolnir 's approach .
the results of a statistical analysis using a paired t - test demonstrate a significant improvement of mjolnir 's interpolation strategy over that of hammer ( p = .0046 ) .
we evaluated the two registration algorithms using the nirep database by choosing one brain randomly as a template , registering the 15 remaining brains to this template and computing the average dice coefficient , region - by - region and overall .
it is observed that mjolnir gives a better alignment in 28 out of 32 of the labeled cortical structures than does hammer and gives a higher average dice coefficient across all regions of the brain ( top row in figure 10 ) , measuring 0.6804 with an sd of 0.0617 while hammer 's average dice coefficient was 0.6416 with an sd of 0.0789 . in a statistical analysis using a paired t - test this result is shown to be statistically significant with a p - value of 4.02  10 .                             in order to determine whether the choice of template might bias the result , we repeated the above experiment using a different randomly selected template image .
it also gave a significantly higher average dice coefficient than hammer ( p = 3.71  10 ) , measuring 0.6507 with an sd of 0.0759 for hammer and 0.6866 with an sd of 0.0632 for mjolnir .                     
finally , in order to eliminate any bias from registering all subjects to a single template image we randomly selected 16 image pairs ( with one randomly selected as the template ) .
the average dice coefficients for the 16 pairwise registrations were computed and are shown in figure 11 . it is observed that mjolnir gives a better alignment in 24 out of 32 of the labeled cortical structures than does hammer and also gives a higher average dice coefficient across all regions of the brain , measuring 0.6680 with an sd of 0.0604 while hammer 's average dice coefficient was 0.6394 with an sd of 0.0748 . in a statistical analysis using a paired t - test
this result is shown to be statistically significant with a p - value of 8.07  10 . a common method used to measure
image registration performance is to register multiple subjects to one template image and then compute the average of the registered images [ 6 , 10 , 27 , 41 ] as follows : 
 ( 7)i(x)=1ni=1nii(x+ui(x ) ) . 
									 here , ii is the ith image in the population , and ui(x ) is the displacement field from subject i to the template .
the best registration approach yields the least noisy and  sharpest  appearing average image , which can be quantitatively assessed by computing the variance of the registered image intensities   as follows : 
 ( 8)i2(x)=1n1i=1n(ii(x+ui(x))i(x))2  . 
									
small variances throughout the field of view indicates a good registration of all subjects to the template ; the average variance across all pixels provides a single figure of merit for algorithm comparison .                                                as in previous experiments , we registered 15 subjects to a randomly selected template , using all images in the nirep na0 database .
figure 12 shows a cross - sectional view of the two average images together with the template image .
it can be observed that the average image generated by mjolnir is sharper than that of hammer , particularly within the cortex .
the average image variance over all voxels within the template 's brain was 52.3 for hammer and 34.5 for mjolnir ( where the intensity range of the images was ( 0 , 255 ) ) .   even when the images are correctly aligned , some variations in intensities between subjects can be expected simply due to both the lack of mr image intensity calibration and the natural variations in the mr properties of human tissues . in this experiment
, we explore whether gray matter is well aligned by the two registration algorithms , despite possible underlying intensity variations . in order to visualize this effect ,
gray matter masks were generated from the labeled  subject  images in the nirep na0 database as follows : 
 ( 9)mi(x)={1,if  x  is  labeled  as  gm  in nirep,0,otherwise , 
									 for i = 1 ,  , 15 ( the  subject  images ) .
after registration of each subject to the template , the sum of the deformed masks was formed as follows : 
										 ( 10)m(x)=i=115mi(xui(x ) ) . 

figure 13 shows the sum of deformed mask points for both algorithms in the first two columns and the original template gray matter mask on the right for comparison .
visually , it is clear that mjolnir yields fewer gross errors  that is , outliers  than does hammer .
figure 14 shows an example of the ( labeled ) gray matter mapping results from both hammer and mjolnir , both in comparison to the true template labels .
this example demonstrates a rather large alignment error in the hammer result , while the mjolnir result is overall more accurate .
while mjolnir is not perfect , the more compact gm mask alignment revealed in figure 13 together with the improvements in average dice coefficient shows that these types of gross errors are less common in mjolnir than in hammer .
some evidences of tissue shearing are visible in the results of mjolnir shown in figure 14 .
the fact is that dramatic deformations must sometimes take place in order to best align homologous brain structures .
most of mjolnir 's deformation fields are fairly smooth ; however , when a dramatic change is required in order to align important landmarks ,
it has the flexibility to do so . figure 14 is an example of such a case .                                       to further investigate the nature of outliers , we examined the alignment of specific sulci using the two methods .
we used cruise   to extract central cortical surfaces from t1-weighted spgr volumetric mr data set obtained from the baltimore longitudinal study of aging ( blsa ) .
sulcal regions  for example , cortex surrounding major sulci  were then segmented using the method of rettmann et al .   and
we then registered a total of 18 subjects to a randomly selected 19th template image using mjolnir and hammer , and the extracted sulcal regions were then deformed using displacement fields derived from the registration processes .
figure 15 shows the 18 superimposed sulcal regions for the left parieto - occipital and the left superior frontal sulcus ( two different views ) .
the sulcal alignment in mjolnir is more compact , while hammer produces a more spread alignment with larger registration errors , which is consistent with previous results from the nirep data .
the two programs , mjolnir and hammer ( version1.0 @ sbia with default parameter values ) , were run on the same machine ( pentium xeon 3.0 ghz , 4 gb ram ) , on the same dataset ( image size 256  256  198 voxels ) , and included all required preprocessing steps .
hammer finished in 3 hours and 22 minutes while mjolnir finished in 2 hours and 50 minutes , a 15% decrease in runtime .
mjolnir , a new deformable registration algorithm introduced in this paper , has several significant benefits over hammer , the algorithm upon which mjolnir was based . among these
are improvements to image preprocessing , more descriptive attribute vectors , improved vector field interpolation , and reduced computation time .
mjolnir was extensively validated both qualitatively and quantitatively using the nirep na0 evaluation database , and its performance was compared with the publicly available hammer .
results showed significant improvements in terms of overlap measure using the dice coefficient of 32 registered gray matter structures of the brain cortex . as well , the intensity variance of 15 coregistered images was lower for mjolnir as compared to hammer . by several additional measures ,
most of mjolnir 's improvements were observed in the brain cortex , which has high variability in the general population ( as compared to subcortical structures ) and is critically important in the study of populations for analysis of regional shape , thickness , and volume changes due to aging and disease [ 1 , 49 , 50 ] .
it is therefore hoped that mjolnir might enable more compact geometric clustering of observed differences and/or to have a larger effect size , permitting smaller studies to observe statistically significant results .
 image registration is a crucial step in many medical image analysis procedures such as image fusion , surgical planning , segmentation and labeling , and shape comparison in population or longitudinal studies . 
 a new approach to volumetric intersubject deformable image registration is presented . 
 the method , called mjolnir , is an extension of the highly successful method hammer . 
 new image features in order to better localize points of correspondence between the two images are introduced as well as a novel approach to generate a dense displacement field based upon the weighted diffusion of automatically derived feature correspondences . 
 an extensive validation of the algorithm was performed on t1-weighted spgr mr brain images from the nirep evaluation database . 
 the results were compared with results 
 generated by hammer and are shown to yield significant improvements in cortical alignment as well as 
 reduced computation time . 
1. Introduction
2. Overview of Major Concepts
3. Preprocessing
4. Displacement Field Interpolation
5. Results and Discussion
6. Conclusion