brain structure segmentation is the apportionment of brain tissue into gray matter and white matter , based on the appearance of tissue in images produced by magnetic resonance imaging ( mri ) .
because manual tracing of the boundaries between tissues in the brain is labor intensive , difficult , error - prone , and unrealistic for large amounts of data , an automated or semiautomated segmentation technique is needed for either visualization or diagnosis .
different imaging modalities , such as t1-weighted , t2-weighted , or proton density ( pd ) images , have been used for different segmentation methods .
t1-weighted images , because of their good contrast , have been widely tested for various segmentation methods [ 26 ] .
a t1-map is a parametric image of pure t1 ( spin lattice relaxation time ) , derived from the solution of an equation describing tissue relaxation , and a parametric t1-map which is different from a t1-weighted image .
the relationship between t1 and several diseases , such as schizophrenia or sickle cell disease , has been studied [ 710 ] , and t1 may be used as a possible indicator of pathology .
change in t1 of certain voxels in the brain over time may be an early indicator of possible pathology .
therefore , the segmentation of a parametric brain t1-map may highlight pathology unseen by other imaging approaches .            
the three tissues white matter ( wm ) , gray matter ( gm ) , and cerebrospinal fluid ( csf ) constitute the main parts in the brain .
different methods have been proposed to achieve this goal , and they may be classified into various categories : fuzzy segmentation methods [ 4 , 11 ] , markov random field ( mrf ) methods [ 12 , 13 ] , bayesian methods , active contour methods [ 1 , 5 , 6 ] , or the combinations of two or more techniques
. some of these combinations are as follows : leemput et al .   used expectation maximization ( em ) and mrf , xu et al
it is an adaptive version of mumford - shah 's model   to systematically segment different tissues in the brain .          before the segmentation ,
a t1-map may be calculated by a rapid method known as the variable nutation method   which provides comparable precision but much faster speed over conventional methods .
this method requires the acquisition of a set of flip angle images and the t1 information can be extracted therein .
[ 18 , 19 ] proposed methods to determine the optimal flip angles by basically maximizing the signal - to - noise ratio ( snr ) of a t1-map .
their first work   required the knowledge of average tr / t1 in advance though , and their second work   introduced a weighted least square method to estimate the angles .
we take another approach to determine the flip angles to achieve the trade - off between acquisition time and t1 accuracy .          
since a t1-map is generated by a set of flip angle images , alignment of the images is important in order to obtain an accurate t1-map .
the registration of flip angle images is usually ignored though because the movement of the head in the coil is minute .
however , slight registration errors affect the resulting t1-map dramatically , as will be shown .           
radiofrequency ( rf)-inhomogeneity is another unavoidable problem encountered in mr imaging . the nonuniform distribution of the rf field can cause the resulting images to have low contrast and inhomogeneous intensity , which makes quantitative description and segmentation of the image difficult .
rf inhomogeneity affects the generation of t1-map in the sense that the spins are not tilted by the predefined nominal angles [ 17 , 2022 ] .
hence , we focus on calibrating the rf nonuniformity in order to generate an accurate t1-map .
cheng and wright   calculated an analytical form of t1 errors induced by rf nonuniformity and allowed simple correction of t1 measurements .
we propose a method , which assumes the average    t1 value among a transverse plane is the same across the central brain slices , to jointly segment a t1-map and calibrate the rf nonuniformity along the direction perpendicular to the transverse plane .
taking into account that we average out the heterogeneity of t1 , and doing so only within few central brain slices , this assumption help calibrate rf - inhomogeneity and generate a quantitative t1-map for segmentation .        
section 2 we state our adapted model , with a fast implementation method . in section 3
we first illustrate some necessary preprocessing to generate an accurate t1-map , which includes the registration of flip angle images with the generation of a brain mask and the determination of optimal flip angles , to achieve a trade - off between quality and efficiency .
we propose a novel method to jointly segment a t1-map and calibrate rf - inhomogeneity , and in section 5 we show the results of registering the flip angle images , determining optimal flip angles , and segmenting the t1-maps .
we also show validations , the resulting t1-map after rf - calibration , and the 3d segmentation for two sets of t1-weighted data . at last in section 6
active contour methods comprise a popular segmentation technique in which an initialized contour is driven by a partial differential equation ( pde ) to minimize an energy functional designed to attract the contour toward image edges .
active contour methods can be classified into two categories : edge - based [ 2427 , 2734 ] and region - based [ 16 , 3544 ] methods .
edge - based methods examine the gradient information of the image , and stop the contour whenever the gradient is high .
however , there are many situations when the edge is not clearly characterized by the gradient , and it has been shown that region - based methods outperform edge - based methods [ 3537 , 41 , 43 , 44 ] . by examining some statistics of the region inside and outside of the active contour , and optimizing the separation of these two statistics , we may achieve a better segmentation performance , thus making region - based methods more attractive .             
our proposed model is a modified momford and shah   functional , and falls in the region - based category .
two adaptations of mumford - shah 's model constitute the novelty of our proposed technique .
first is the incorporation of an information - theoretic view , which characterizes the statistical property of data .
the second is a selective weighting , similar to the weight parameter in , which favors erring towards one tissue type or another , and thus make 3-tissue segmentation possible .
we use a modified mumford - shah   energy functional : 
								 ( 1)e(frin , frout , c)=i = in , outiri{(frig(i))2+fri2}dx+cds , 
							 where fri approximate a function g( ) applied of the image i for region ri , i = in or out .
fri is smooth within each region ri , but not across the boundaries ; c denotes the region boundaries , which is the contour of interest in this paper , and 0  i  1 are weights such that in + out = 1 . by minimizing this functional
we obtain a function fri which is faithful to the image ( first term ) and smooth within each region but not across the boundaries ( second term ) , while penalizing excessive length of the boundaries ( last term ) .           
the first adaptation is the function g( ) applied on to image i instead of the image itself .
specifically , an information - theoretic approach for maximizing a probabilistic disparity measure , jensen - shannon ( js ) divergence , was proposed .
a constructed function g( ) characterizes the property of the probability density function ( pdf ) of the image intensity such as skewness ( g(i ) = i ) , or kurtosis ( g(i ) = i ) , relative to a gaussian . a proper choice of g( )
will capture the statistical characteristics of the data and will hence achieve a good segmentation .        
the second adaptation , similar to that in , is the selective weight i applied on the inside / outside energy terms .
this provides a probabilistic assignment to the segmented regions , and also makes 3-tissue segmentation possible , as will be shown in section 3 . enhancing the weight in is tantamount to penalizing both the error of the difference between the approximated function frin and the data fidelity term g(i ) , as well as the degree of smoothness of frin
this would yield a smaller segmented region which is likely to be more faithful to the image , and of  purer  tissues .
figure 1 shows examples of white matter ( wm ) segmentation with different weights . with a larger inside - weight in ,
the segmented region is smaller and the segmented tissues are purer . minimizing the mumford - shah energy
functional involves solving for the approximating functions frin / out and for the contour c. the joint search for these infinite dimensional unknowns usually entails gradient descent flows .
in particular , the approximated functions are typically modeled as a linear combination of a basis set whose dimension equals the number of pixels in the image , that is , each pixel is assumed to be independent .
alvino and yezzi   proposed a fast implementation using a significantly smaller basis number to model the approximated functions , while still achieving sufficient resemblance to the obtained functions when using the pixel - by - pixel basis .         
we adopt their so - called linear heat equation basis with the change from i to g(i ) to incorporate the statistical properties of the data from an information - theoretic point of view in the previous section .
we hence have , 
								 ( 2)fri=1,ig(i)+2,imean(g(i ) ) , 
							 where mean( ) is the average function , and the coefficients j , in(out ) , j = 1,2 , may be similarly derived in .
our derivations are included in the appendix .              substituting   ( 2 ) into   ( 1 ) , and using a classical methods of variational calculus
, the gradient descent evolution of the curve may be derived as 
								 ( 3)ct={out[(froutg(i))2+frout2 ]  in[(fring(i))2+frin2]}nn,(4)=(outfoutinfin)nn , 
							 where  denotes the curvature of the contour c ,   t an artificial time evolution parameter , and n the outward normal of the contour .
fin / out are derived by substituting frin / out from   ( 2 ) into   ( 3 ) as shown in the appendix .
a brain parametric t1-map is the calculated result ( variable nutation method ) from several flip angle images . because the flip angle images are acquired at different times , and because the subject may move during image acquisition , registration should be carried out first to obtain an accurate t1-map .
moreover , in order to achieve a balance between the acquisition time and the resulting t1-map quality , we propose a method to determine optimal flip angles . in the following subsections
we will first illustrate how we register the flip angle images and obtain a brain mask as a byproduct , then describe our method to determine a set of optimal flip angles , and at last describe our proposed procedure to segment a t1-map .
the value of t1 is traditionally determined by acquisition methods such as inversion recovery ( ir ) or saturation - recovery ( sr ) .
other rapid methods , such as variable nutation ( the despot method ) have been proposed , and require acquisition of several flip angle images , and calculation of t1 .
since these flip angle images are acquired at different times , registration must first be accomplished . even though the interval between consecutive scans may be as short as two minutes , and movement of the subject 's head inside the receiver coil
may be a few pixels ( under the resolution of a 256  256 image ) , the effects of such off - registration can be significant , as shown ( figure 5 ) . here
we describe a method to register flip angle images and jointly obtain a mask , as a byproduct , to get rid of the skull and other structures around the brain .        
we use a joint segmentation and registration ( jsr ) technique proposed by yezzi et al .   with an additional tuning weight , to achieve registration and to obtain the mask .
the theory of jsr technique consists of evolving two contours , with a enforced relationship ( ex : rigid or affine transform ) between them , in two images according to a partial differential equation ( pde ) which is a result of optimizing , for example , the sum of two energy functionals .        for our particular task
, we may choose a region - based energy , such as chan and vese 's model   incorporating weights , which arises as a special case of   ( 1 ) with the data term g(i ) = i and the approximating function frin / out = mean(i ) inside and outside the contour .
this model approximates the image i by a simple piecewise constant function , which suits our goal here because it creates a mask that divides the image into two parts- brain region and nonbrain region .       
we observe that the boundary between the brain and nonbrain is visually more easily distinguished than the boundary between different tissues within the brain , for every flip angle image .
we therefore put a very small weight in on the inside energy in   ( 1 ) to penalize very little the difference between the data inside the contour , i , and the approximated function mean(i ) .
we carry out this registration technique pairwise for all flip angle images , and once the flip - angel images are registered to each other , they are used to generate a t1-map .
the determination of the flip angles that yields qualitative t1-map and saves time , is mainly by comparing the difference between the gold standard and the t1-maps generated from different combinatorial flip angles .
we begin by acquiring images at a set of 19 flip angles which spans the range of standard angles   and will give an optimized t1-map .
we call this particular t1-map the gold standard , or t1 g , and denote this set of angles as 19 = [ 2 , 5 , 10 , 15 , 20 , 25 , 30 , 35 , 40 , 45 , 50 , 55 , 60 ,     65 ,    70 , 75 , 80 , 85 , 90 ] .
we then compare the t1-map generated from all combinations of the subset of 19 with t1 g . out of these combinations
since the data acquisition is slice - based , this study of optimal flip angle focuses on the central slice , which is least affected by rf - inhomogeneity   and is routinely selected at the level of the basal ganglia , including both the genu and the splenium of the corpus callosum , and generally shows the putamen and lateral ventricle .
we denote the optimal n - angles opt , n , which is a subset of 19 , as those that exhibit the smallest difference between t1 g and the t1-map generated by n flip angles : 
								 ( 5)opt , n = arg  min  n(x , y)brain|t1g(x , y)t1n(x , y)| , 
							 where n  { 2,3 ,  , 19 } , n19 , t1n denotes the t1-map generated by n , and the summation of ( x , y ) is over the whole brain region at the central slice .          equation ( 5 ) therefore gives 18 sets , with the number of elements ranging from 2 to 19 , of optimal angles . for the determination of the optimal set of flip angles , in reaching a compromise between efficiency and t1-map quality
, we examine the error between t1opt , n and t1 g and compute the error rate .
the error rate is defined as 
								 ( 6)e=(x , y)braine(x , y)a(brain) , 
							 where a(brain ) is the area of the brain , and e(x , y ) is the error , defined as 1 if the difference between t1g(x , y ) and t1opt , n(x , y ) is greater than some threshold  , and 0 otherwise . the threshold  is defined as the minimum of the standard deviation among the t1 values of three brain tissues ( wm , gm , and csf ) manually segmented by an expert .
the summation of e(x , y ) is over the whole brain at the central slice .      
the plot of the error rate versus the number of flip angles is shown in figure 6 , where the inflection point of the fitted curve is at 10 flip angles ( opt,10 = [ 2 , 5 , 55 , 60 , 65 , 70 , 75 , 80 , 85 , 90 ] ) .
once the brain mask is obtained ( section 3.1 ) , it is used to segment away the skull , leaving only three major tissues in the image : wm , gm , and csf .
notice that the curve evolution corresponding to the energy introduced in section 2 always results in a  binary segmentation  , where we will have regions inside ( foreground ) and outside ( background ) the contour(s ) .
we can not simultaneously segment the three tissues , even though we will later talk about multiphase segmentation .
we may , however , tune the weights ( section 2.1 ) , to penalize the error between the data term and the approximated function ( 1 ) to segment one tissue at a time , with a progression analogous to that of  peeling an onion  .        
we illustrate our t1-map segmentation procedure for a hard segmentation of three tissues , and the probabilistic segmentation is obtained by varying the weights around the value of the trained weight ( section 5.4 ) .
a t1-map segmentation procedure consists of three steps , where the first two steps are to evolve the contours by minimizing the energy in   ( 1 ) with different weights , and the third step is just a simple subtraction .
the procedure is as follows :    treat wm as the foreground , everything else as the background ; let in in   ( 1 ) be the trained in , wm , and use it to segment wm in the interior region of the contour .  
treat wm and gm as the foreground , csf and everything else as the background ; let in in   ( 1 ) be the trained in , csf , and use it to obtain csf in the exterior region of the curve filtered by the brain mask .  
the procedure is based on the anatomical observation that gm is enclosed by csf , and that csf is separated from wm [ 1 , 3 ] , such that we may peel off one layer at a time .        
the choice of function g(i ) in   ( 1 ) , which is chosen to better capture the statistical property of t1-map ( and for other modality ) , will be shown in section 5 .
the values of in , wm and in , csf are determined through a training process .
if re denotes the segmentation region by the expert , and rin denotes the segmentation region by the weight in with some fixed g(i ) , for some tissue , then the value of in , tissue is determined by minimizing 
								 ( 7)in , tissue = argmin  in{1|rerin||rin|+|re||rerin| } , 
							 where |r| denotes the number of pixels in region r. the first term inside the bracket is an overlap metric ( om )   which will be discussed again in section 4 .
the strength of the rf field varies within the mr scanner , such that the resulting image may be of low contrast or of nonuniform intensity . in what follows
, we will first describe how a t1-map is calculated from a set of flip angle images , then how the t1-map is affected by rf - inhomogeneity and then show our proposed correction method .   a t1-map is calculated by variable nutation .
flip - angle images are acquired using a flash sequence at different flip angles , and t1 is calculated from the slope of a least square fitted line to the pair of data [ s()/sin  , s()/tan  ] , where s( ) is the signal strength of the flip angle image expressed as a function of the flip angle .         rf - inhomogeneity affects the computation of t1 in that the spins are not tilted by the nominal angle because the strength of the rf field is not as predefined .
calibration of rf - inhomogeneity , or , the correction of flip angles , produces a more accurate t1-map . a spatially dependent scaling factor  , therefore , is introduced to adjust the tilted angle [ 20 , 22 ] , that is , replacing  by (8)[s()sin(),s()tan( ) ] , 
							 and t1 is extracted from the slope of the line fitted to the above space .
our imaging setting is slice - based across different transverse planes ( figure 2 ) , thus our proposed joint segmentation and rf - inhomogeneity calibration ( jsric ) method is as an initial step to easily calibrate rf - inhomogeneity vertically .
our method is based on the assumption that the average    t1 of wm should be roughly the same across central brain transverse slices .
we however average out the heterogeneity of t1 , and carry out the method only within few central brain slices .
the advantage is that as the segmentation delineates more precisely the wm region , flip angle correction is therefore enhanced , and as flip angle correction is carried out more precisely , which gives better quality t1-map , segmentation is facilitated as well .                  
our joint segmentation and rf - inhomogeneity calibration ( jsric ) method requires first taking the average t1 value for segmented wm at the central slice ( which has relatively uniform b1 field [ 51 , 53 ] ) as the reference , and then iteratively segmenting and searching for the scaling factor  in   ( 8) for all other slices .
this is a three - step iterative process ( as shown inside the dashed box in flowchart 3 ) .   
segment wm for the central slice by the method proposed in section 3.3 , compute the average t1 value of wm , and denote the average as m. for slice m , varies  in   ( 8) , and calculate the corresponding t1-map , denoted as t1( ) .
if  goes beyond max , claim the current slice as uncalibratable and repeat this step for the next slice m + 1 .
segment wm for t1( ) , compute the average t1 of wm , and denote it by l( ) .
if m  l( ) , go back to step 2 and increase  , otherwise claim it is done for the current slice .     
the variables min , max , and  in flowchart 3q are all predefined parameters .
in this section we show a series of results from segmenting a parametric brain t1-map , which includes the registration of flip angle images , generation of a brain mask as a byproduct , determination of the optimal flip angles , and joint t1-map segmentation and rf - inhomogeneity calibration .
in addition , we will apply our proposed segmentation method to another modality , t1-weighted images , in a 3d setting , to show the generality of our segmentation method .
the subjects being scanned were recruited from a clinic in the department of psychiatry at the university of north carolina , under an irb - approved protocol to image the brain .
a transverse 3d flash sequence using different flip angles was acquired in a 3 t siemens mri scanner with a quadrature head coil .
the scan parameters were : tr = 25 msec , te = 2.83 msec , 16 slices , and slice thickness = 5 mm .
the center slice used for optimal flip angle study was routinely selected as described ( section 3.2 ) .
the registration of a set of flip angle images is carried out pair wise , and figure 4 shows two flip angle images and the resulting brain mask .
note that even though the flip angle images are off - registered by no more than four pixels in both the x- and y - directions , the impact is obvious .
figure 5 shows two t1-maps generated by registered and unregistered flip angle images , and we can see that after registration the anatomical structure of the t1-map is more readily distinguished , and the high signal intensity artifact in the upper left of the unregistered t1-map map is reduced .
the plot of the error rate e ( defined in   ( 6 ) ) versus the number of flip angle is shown in figure 6 , and section 3.2 already concluded that a set of 10 flip angles ( opt,10 = [ 2 , 5 , 55 , 60 , 65 , 70 , 75 , 80 , 85 , 90 ] ) is a good compromise between t1 quality and efficiency .
figure 7 shows a comparison of generated t1-maps when using 2 optimized flip angles ( [ 5 , 55 ] ) , 6 optimized flip angles ( [ 2 , 5 , 60 , 65 , 70 , 75 ] ) and 10 optimized flip angles , with an  error map 
the t1-map generated by 2 angles exhibits substantially more error than the maps using 6 or 10 angles , as shown by the bright pixels in the error map .
we conclude that 10 flip angles is an acceptable choice considering the trade - off between accuracy and scan time .  
out of a total of 16 slices , the bottom 4 slices were discarded because they did not cover sufficient wm for segmentation by our jsric method .
the method follows the flowchart in the dashed box shown in figure 3 from slice 5 to slice 15 .
slice 16 could not be calculated , possibly because of its proximity to the boundary of the rf field and hence degraded .         
the function g(i ) introduced in   ( 1 ) was empirically chosen as the cubic function i , which characterizes the skewness of a pdf .
moreover , in , wm and in , csf are obtained by training according to   ( 7 ) based on an expert 's manual segmentation of one subject ( training subject ) .
these values are in , wm = 0.93 and in , csf = 0.53 . the same values are then applied to the other subject ( testing subject ) .
the segmentation of a t1-map is achieved by evolving contours according to   ( 4 ) .
since the curve evolution is based on a gradient flow , the final result may vary depending upon the initialization .
a t1-weighted image histogram is shown ( figure 8(a ) ) , and a spectral analysis can be carried out to threshold the image as an initialization [ 5 , 55 ] , to achieve a good segmentation after fine tuning of the contour .
the t1-map does not have the same level of contrast as a t1-weighted image ( figure 8(b ) ) .
we therefore initialize the contours by either placing uniformly spaced squares or by manually seeding ( by mouse clicking and dragging on the image ) .
(  versus slice number ) for two subjects , where the parameter  is as defined ( section 4.1 ) . the strength of the rf field drops significantly at the top slices ( slice 14 and 15 ) such that the corresponding flip angles have to be rectified by a scaling factor much smaller than 1 .
figure 10 shows two t1-maps generated with and without flip angle rectification for the same subject at slice number 5 , 6 , 14 and 15 .
it is clearly seen that the top 2 slices of the t1-maps with calibration have much better quality than those without . 

figure 11 shows some selective segmentation results of wm and gm for the test subject .
the commonly examined metrics which determine the performance of a segmentation are tp ( true positive ) , fp ( false positive ) , and om ( overlap metric ) [ 1 , 5 ] .
the overlap metric is defined for a class assignment as the sum of the number of pixels that both have the class assignment in each segmentation divided by the sum of pixels where either segmentation has the class assignment .
this metric approaches 1 for segmentations that are very similar , and is near 0 when they share no similarly classified pixels .
figure 12 shows three overlap metric curves ( om versus slice number ) of wm and gm segmentation for the training subject ( the test subject exhibits a similar result ) .
the first curve corresponds to the segmentation of calibrated t1-maps , with our tuned weights and cubic function g(i ) = i , the second corresponds to the t1-maps generated by nonrectified flip angles ( using the same segmentation parameters ) , and the third corresponds to the calibrated t1-map , with function g(i ) = i and tuned weights ( in , wm = 0.9 and in , csf = 0.7 ) .
these results show that calibrated t1-maps enhance the segmentation performance compared to un - calibrated t1-maps , especially at the top two slices ( slice 14 and 15 ) which are most seriously affected by rf - inhomogeneity .
the comparison of different functions g(i ) shows that the performance of wm segmentation is comparable for the two functions .
there is , however , a significant difference for csf segmentation , thus affecting gm segmentation . the cubic function
it also demonstrates that the cubic function better characterizes the statistical properties , the skewness , of the data .
figure 13 shows tp and fp for wm segmentation with different weights in around the value of in , wm , to demonstrate the notion of our probabilistic segmentation .
tp = |rinre|/|re| , and fp = ( |rin|  |rinre|)/|re| , where re and rin are the expert segmented regions and ours using in respectively , and |r| denotes the area of region r. when the weight increases , so does the penalty for the error between the data term and the approximating function ( 1 ) . therefore tp and fp decrease correspondingly , and vice versa . in this section we show the generality of our proposed segmentation method in a 3d setting by applying it to a commonly exploited modality  t1-weighted images .
the same procedures are carried out as in section 3.3 , except that now the images are collated into volumes and the active contour is replaced by an active surface .
we test it on two open databases accessible online brainweb ( http://www.bic.mni.mcgill.ca/brainweb/ )   and ibsr ( http://www.cma.mgh.harvard.edu/ibsr/ ) .
the former is a simulated brain mri database , therefore ground truth is provided and the latter is genuine brain mri data which also has been manually segmented by experts .
we preprocessed the data to filter out everything except for the three main tissues , wm , gm , and csf .               
we first tested our segmentation method on two brainweb subjects ( a training and a testing subject ) using simulated brain t1-weighted data .
the images are 1 mm slice thick , with 3% noise level , and 20% rf intensity nonuniformity ( inu ) and each data set was 217  181  106 pixels . because the contrast between different tissues was high , we did a histogram analysis and applied the threshold method similar to   for initialization .
as i , and in , wm and in , csf are obtained by training as 0.3 and 0.2 respectively .
the results show that it achieves a high performance of om being around 0.8 for three tissues .
the computational time for one subject is less then 1 minute on a laptop with a 1.73 ghz cpu and 1 gb memory .
we then tested our segmentation method on 20 data sets of t1-weighted images provided by the center for morphometric analysis at massachusetts general hospital on the ibsr website .
the data set for each subject was 256  256  l , where l ranges from 58 to 63 pixels .
we arbitrarily chose one subject ( subject 1_24 ) as the training data , empirically chose the function g(i ) = i for wm and g(i ) = i for csf , frin(out ) = meanin(out)(g(i ) ) , in , wm = 0.75 , and in , csf = 0.2 .
we did not carry out any preprocessing to denoise the data or to decrease the rf - inhomogeneity effect which seriously degraded the data .
therefore the spectral analysis could not be carried out and we used uniformly spaced cubes as the initialization .
out of 20 subjects we however still have 3 particularly unsuccessful cases ( specifically subject 2_4 , 16_3 , and 111_2 ) due to rf - inhomogeneity which we did not rectify . including these three subjects
, we have an averaged overlap metric around 0.651 , and if excluding these 3 outliers , we achieved an averaged om of around 0.707 . the computational time is less then 5 minutes on the same pc as above .
the statistics show that our method outperforms most other methods even if the outliers are included ; if excluding those , we have wm segmentation slightly poorer but gm segmentation slightly better than the current best segmentation method .
to register flip angle images we used the jsr technique , which has the advantage of jointly segmenting , registering , and generating a brain mask .
other techniques such as the information - theoretic method   only register the images , and the brain mask has to be otherwise generated .
our jsr has been carried out pair wise on 10 flip angle images , registering 9 images to a reference image . in theory , however , it should be possible to integrate multiple - image in jsr 's formulation . by summing the energy functionals of multiple images with a relationship enforced between each contour , that is , e(c1 , g2 ,  , gn ) = e1(c1 ) + e2(g2(c1 ) ) +  + en(gn(c1 ) ) , where ci = gi(c1 ) , i = 1 ,  , n
, the evolution of the contours ci and registration parameters gi may be derived similarly .
our segmentation of three brain tissues is based on the tuning of weights , to penalize differently the error of the approximated function , to obtain different regions of tissue .
segmentation uses the anatomical nature of brain tissue which has a layered structure such that we may peel off one layer at a time .
our method uses an active contour that is able to separate an image into two parts : the inside and the outside of the contour . however , multiphase active contour techniques exist [ 36 , 58 ] and are able to evolve multiple contours simultaneously and segment multiple regions at once .
our method is different in the sense that it has a probabilistic flavor that the tuning weights determine a purity - level of segmented tissues .
our jsric method works by enforcing the average of white matter t1 value to be homogeneous across different transverse planes in the central brain region , to find the scaling factors  which affects the flip angles . even though t1 has regional heterogeneity , by taking the average of wm for the transverse plane we average out this heterogeneity , and doing so only in the central brain region .
wm segmentation and rf - calibration enhance the precision of one another , as shown in the performance plot in the previous section .
in conclusion , we propose an adapted mumford - shah type energy functional for segmentation .
the two adaptations are : ( 1 ) a function g(i ) is able to characterize the statistical properties of the data to achieve better segmentation results , and ( 2 ) the tuning weights in(out ) are able to segment brain tissues in a probabilistic fashion and achieve three - tissue segmentation .
we also propose a novel method ( jsric ) to jointly segment a t1-map and calibrate rf - inhomogeneity .
the whole procedure moreover includes the determination of optimal flip angles in achieving the balance between accuracy and efficiency , and joint registration of flip angle images and generation of brain mask .
after rf - calibration , the top and bottom slices of t1-maps show better contrast and enhance the segmentation performance . the segmentation method has also been applied to t1-weighted data , to show the generality of our segmentation method , and the results are validated by ground truth and by expert manual segmentations .
to derive the gradient flow of our energy in   ( 1 ) with alvino et al .
's   fast mumford - shah implementation , we first restate their result for the approximated function in scale space .
suppose the approximated function fri , i = in or out , is expressed as a linear combination of basis j : 
								 ( a.1)fri=j=1nj , ij , 
							 then the coefficients j , i can be solved by a linear system 
								 ( a.2)i+ii=i , 
							 where 
								 ( a.3)i=[ri11rin1ri12rin2ri1nrinn],i=[ri1,1rin,1ri1,2rin,2ri1,nrin,n ] , 
							 and each n  n matrices must be computed for each region .
also , 
								 ( a.4)i=[1,i2,in , i ] ,  i=[ri1g(i)ring(i ) ] 
							 are each n  1 vectors .          
therefore we may replace the basis j by g(i ) and mean(g(i ) ) as in   ( 2 ) , and solve for the coefficients i : 
								 ( a.5)1i = timisiti+wimisi ,  2i = witi+wimisi 
							 where 
								 ( a.6)si=rig(i)dxdy ,  mi = siridxdy , ti=rig(i)2dxdy ,  wi=rig(i)2dxdy .                 then substituting the coefficients in   ( 2 ) by the above results and then pluging   frin(out ) into   ( 3 )
 we propose a constrained version of mumford and shah 's ( 1989 ) segmentation model with an information - theoretic 
 point of view in order to devise a systematic procedure to 
 segment brain magnetic resonance imaging ( mri ) data for 
 parametric t1-map and t1-weighted images , in both 2-d and 
 3d settings . 
 incorporation of a tuning weight in particular adds 
 a probabilistic flavor to our segmentation method , and makes 
 the 3-tissue segmentation possible . 
 moreover , we proposed a 
 novel method to jointly segment the t1-map and calibrate rf inhomogeneity 
 ( jsric ) . 
 this method assumes the average t1 value of white matter is the same across transverse slices in 
 the central brain region , and jsric is able to rectify the flip angles 
 to generate calibrated t1-maps . in order to generate an 
 accurate t1-map , 
 the determination of optimal flip - angles and 
 the registration of flip - angle images are examined . 
 our jsric 
 method is validated on two human subjects in the 2d t1-map 
 modality and our segmentation method is validated by two public 
 databases , brainweb   and ibsr , of t1-weighted modality in 
 the 3d setting . 