Abstract:
A method of generating a susceptibility map of an object utilizes a regularizing inverse function, oversampling k-space, removing external phase noise and rapid phase change effects, accounting for the known geometry of the object, and using modified SWI phase data to generate reasonable susceptibility maps and digital images therefrom, such as SWI images. The inventors refers to the inventive methods set forth herein as Susceptibility Weighted Imaging and Mapping (SWIM).

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    None. 
       STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT 
       [0002]    Not Applicable. 
       APPENDIX 
       [0003]    Not Applicable. 
       BACKGROUND OF THE INVENTION 
       [0004]    1. Field of the Invention 
         [0005]    This invention relates generally to nuclear magnetic resonance imaging (commonly referred to as MRI). More specifically, this invention pertains to a method of creating a magnetic resonance susceptibility image of an object from it&#39;s MRI data using susceptibility weighted imaging and susceptibility mapping. 
         [0006]    2. General Background Technology 
         [0007]    Various magnetic resonance imagining techniques utilize susceptibility weighted imaging (SWI) to enhance the contrast between spatial discontinuities in the magnetic susceptibility within objects being scanned. SWI is described generally in U.S. Pat. No. 6,658,280, which is hereby and herein incorporated in its entirety by reference. 
         [0008]    The ability to quantify local magnetic susceptibility is tantamount to being able to measure, the amount of iron in an object or body whether it is in the form of non-heme iron (such as ferritin or hemosiderin) or heme iron (de-oxyhemoglobin), or the amount of calcium or any other susceptibility affect causing materials including geometric effects. Recently, several methods of quantifying local magnetic susceptibility have been developed that utilize a fast Fourier transform approach. One of such methods utilizes the inverse of the Green&#39;s function. 
         [0000]        g ( k )=1/3 −k   z   2 ( k   x   2   +k   y   2   +k   z   2 ) 
         [0000]    where k x , k y , and k z  are the coordinates of the spatial-frequency domain of the phase data. That method, being derived from an ill-posed problem, is fraught with difficulties. The ill-posedness arises from zeros in the denominator of the analytic filter. To this end, various complicated and lengthy methods involving regularization, multiple scans acquired with the object being rotated between scans, and constrained least squares approaches have been practiced in an effort to improve results. 
         [0009]    Whereas a least squares approach requires relatively accurate knowledge of the geometry of the object, methods using multiple orientation data require additional time for collecting data in different object orientations. The least squares approach in some cases also imposes a homogeneous-susceptibility constraint within an entire object. The direct inverse approach presented here overcomes these limitations as it primarily uses magnetic resonance phase information of the object from a single orientation and is a rapid and easily implemented technique. 
         [0010]    Further, unlike SWI which has an orientation dependence on the phase behavior and hence in the end affects the final contrast, the present invention creates a data set that is independent of the object&#39;s orientation to the main magnetic field. Therefore, if one were to use the susceptibility data rather than the usual filtered phase data to create SWI data, the results will be superior in terms of not having an orientational dependence. 
       SUMMARY OF THE INVENTION 
       [0011]    The present invention allows for the generation of superior quality magnetic source images or susceptibility maps (SM) of objects. Regularizing the inverse function, g −1 (k), oversampling k-space, removing external phase noise and rapid phase change effects, and using SWI high pass filtered phase data, reasonable susceptibility maps can be generated from SWI data. The inventors refer to the inventive methods set forth herein as Susceptibility Weighted Imaging and Mapping (SWIM). The SWIM data can also be used to generate more robust SWI results, since the SWIM data is orientation independent. 
         [0012]    In one aspect of the invention, a method of nuclear magnetic resonance imaging an object comprises a step of acquiring phase data, φ(r), from a gradient echo magnetic resonance scan of the object for a first matrix of N x  by N y  by N z  data points, where N x , N y , and N z  are each a positive integer (but necessarily the same integer). The method also includes generating φ(r) new  for a larger matrix of aN x  by bN y  by cN z  data points, where aN, bN, and cN are each a positive integer (at least one which is greater than the corresponding value of first matrix). This is done using φ(r) and by assigning a constant to data points that are not common to both the first matrix and the larger matrix (many intermediate filtering steps could first be performed on φ(r), but φ(r) new  is nonetheless dependent upon φ(r)). The method further comprises, Fourier transforming φ(r) new  and generating k-space data (φ)(k)) (corresponding to phase), therefrom. The method still further comprises multiplying φ(k) by a susceptibility mapping filter function and inverse Fourier transforming the product in a manner generating a susceptibility map estimate for the larger matrix. From all this, a digital image file of the object is created using the susceptibility map estimate. It should be appreciated that the term “using” is meant herein to be broad and means only that the digital image file is dependent in some manner on a step of generating this susceptibility map estimate. In other words, the digital image file may be dependent upon a more refined susceptibility map and/or other k-space or image data, but at some point the susceptibility map estimate is generated and ultimately plays a part in the generation of the digital image file. 
         [0013]    In another aspect of the invention, a method of nuclear magnetic resonance imaging an object comprises acquiring phase data, φ(r), from a gradient echo magnetic resonance scan of the object and generating original k-space data (φ(k)) (corresponding to phase) using φ(r). The method also comprises multiplying φ(k) by a regularized susceptibility mapping filter function and inverse Fourier transforming the product in a manner generating a susceptibility map estimate. Furthermore, the method comprises applying a threshold to the susceptibility map estimate and generating a revised susceptibility map estimate therefrom. Still further, the method comprises Fourier transforming the revised susceptibility map estimate and generating revised k-space data therefrom. Moreover, new k-space data is generated using both the original k-space data and the revised k-space data. From there, the new k-space data is inverse Fourier transformed to generate a modified susceptibility map estimate therefrom. Finally, a digital image file of the object is created using the modified susceptibility map estimate. 
         [0014]    In yet another aspect of the invention, a method of nuclear magnetic resonance imaging an object comprises collecting k-space data from a gradient echo magnetic resonance scan of the object. The method also comprises generating initial phase and initial magnitude values using the k-space data, and generating a revised set of phase values using at least some of the initial magnitude values and at least some of the initial phase values. Still further, the method comprises generating local change in magnetic field values using at least some of the revised set of phase values, generating modified k-space data values (corresponding to phase) using at least some of the local change in magnetic field values, generating regularized modified k-space data values by applying a regularized inverse filter to the modified k-space data values, generating first susceptibility values using the regularized modified k-space data values, and generating second susceptibility values by applying a threshold to the first susceptibility values and/or by replacing the susceptibility values by a set of pre-determined values. From there, third k-space data values are generated using the first susceptibility values, fourth k-space data values are generated using the second susceptibility values, and the third k-space data values and the fourth k-space data values are merged in a manner generating a fifth k-space data values. Finally, third susceptibility values are generated using the fifth k-space data values, and a digital image file of the object is generated using the third susceptibility values. 
         [0015]    Still further, another method in accordance with the invention pertains to a method of nuclear magnetic resonance imaging an object that comprises acquiring phase data, φ(r), from a gradient echo magnetic resonance scan of the object. The method also comprises, replacing values in a subset of voxels of φ(r) with constant values based upon the geometry of at least a portion of the object. Still further, the method comprises generating original k-space data (corresponding to phase), herein referred to as φ(k), using φ(r) and multiplying φ(k) by a regularized susceptibility mapping filter function and inverse Fourier transforming the product in a manner generating a susceptibility map estimate. A digital image file of the object can then be generated using the modified susceptibility map estimate. 
         [0016]    Further features and advantages of the present invention, as well as the operation of various embodiments of the present invention, are described in detail below with reference to the accompanying drawing figures. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0017]      FIGS. 1-6  depict flowcharts of the steps of the preferred embodiment of the invention. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0018]    A detailed flowchart of the preferred method of practicing the present invention is set forth in  FIGS. 1-6 . This method can be performed on newly acquired nuclear magnetic resonance data or existing data to generate an image of an object that is based, at least in part, on the differences in magnetic susceptibility throughout the image and can be performed in two or three dimensions. 
         [0019]    The method begins by obtaining phase image data (a data matrix) in a given size (i.e., of given numbers of data points in each dimension). That phase data is masked and filtered. This filtered and mask phase data is then used to partially fill a larger matrix. The phase data of the larger matrix is then Fourier transformed to yield modified k-space data. These steps are shown in Steps i-vii of  FIG. 1 . A regularized susceptibility mapping filter function (also referred to as regularized Inverse Green&#39;s Function) is also calculated (Steps viii and ix) for the larger matrix. These two processes can be performed simultaneously or in either order and are described immediately below in greater detail. It should also be appreciated that the regularized susceptibility mapping filter function could be replaced by an un-regularized or discrete version of it or an ideal filter as shown by subsections (A) and (E) in step x. 
         [0020]    The generating of the modified k-space data using the filtered phase for the larger matrix involves several steps shown in  FIG. 1 . First, original magnitude and phase image data values are obtained from either a new MR scan of an object or previously collected MR scan data for a matrix of size N x , N y , N z  in the x, y, and z directions respectively (where N x , N y , and N z  are positive integers) (Step i). As shown in Step ii, a filter is then applied to the phase image data to remove effects from background field inhomogeneities. Various filters, such as unwrapping and highpass filtering, simple highpass filtering using homodyne processing, and phase fitting using polynomials or using a field estimation model based on a-priori geometry information, can be applied for this purpose and can be applied individually or in combination. This alters the phase image data values of some of the voxels in the phase image thereby creating a new set of phase image data values, φ filtered (r), for the original matrix of voxels. Several masks can be applied to further refine the phase image data values of the original matrix, as shown in Steps iii-v. For example, as shown in Step iii, voxels of the original matrix having low magnitude data values in comparison to the overall noise (i.e., low magnitude Signal-to-Noise Ratio or simply SNR) can be identified. One such technique for identifying and reducing noise is described in U.S. Pat. No. 7,573,265, titled “Complex threshold method for reducing noise in nuclear magnetic resonance images,” which is herein and hereby incorporated by reference in its entirety. Additionally, as shown in Step iv, voxels where phase effects are known to be caused by something other than susceptibility can be identified. These masks can then be merged or applied separately to the phase image by replacing the phase data values of the voxels identified with zeros (or some other constant value determined by the shape and orientation of the object). Still further, as shown in Step vi, the matrix size is increased in size to aN x , bN y  and cN z  voxels (where a, b and c are positive integers), preferably by zero filling the phase image data values of the additional voxels. It should be appreciated that the masking steps and the step of increasing the matrix size can occur in any order. This results in a larger set of filtered phase image data values (denoted φ ZF M filtered (r) in the figures). The final step in generating the modified k-space data simply involves Fourier Transforming φ ZF M filtered (r) to obtain the modified k-space data (denoted φ ZF M filtered (k) in the figures). 
         [0021]    The regularized susceptibility mapping filter function is generated as shown in Steps viii and ix in  FIG. 2 . These two steps are performed in the order shown to yield the regularized susceptibility mapping filter function, which is the regularized inverse filter denoted by g −1   reg (k). It should be appreciated that this regularized inverse filter is generated from all the coordinates of the new, larger matrix size. In step ix, k z0  denotes the set of k z  coordinates at which g(k x , k y , k z )=0. 
         [0022]    After having performed the steps above, a susceptibility map estimate is calculated by multiplying the regularized susceptibility mapping filter function and the modified k-space data (voxel by voxel, Step x) and thereafter inverse Fourier transforming the product (step xi). This yields an initial susceptibility map, denoted χ(r) in the figures. At this point, the object field of view (FOV) of χ(r) may, if desired, be returned to the original FOV, i.e., matrix size is same as N x  N y  and N z , without loss of any information. To enhance the susceptibility map, the additional steps shown in  FIG. 3  can be performed. As Step xii shows, a threshold can be applied to the susceptibility map in an effort to remove noise and artifacts, yielding a revised susceptibility map χ′(r). Furthermore, in certain conditions where the range of expected susceptibility values might be known from the properties of the system under investigation, Step xii may include replacing values with expected values of the susceptibility. Additionally, a substitution in k-space can further enhance the susceptibility map. Such a substitution can be performed according to steps xiii-xv. These steps involve Fourier transforming the revised susceptibility map in a manner obtaining a new k-space data set, χ′(k), replacing the values of χ(k) with those of χ′(k) at voxels where g −1 (k)≧a′ (where a′ can be equal to a of Step ix or some other value) to create a new modified k-space data set, χ mod (k), and then inverse Fourier Transforming χ mod (k) in a manner generating a modified susceptibility map χ mod (r) estimate. As shown in  FIG. 3 , these steps can be repeated for a given number of iterations or until the susceptibility map changes by less than a predetermined amount. With each iteration, the set of χ mod (r) values replace the previous set of χ(r) values and then χ(k) is set equal to the Fourier transform of χ(r), as is shown in step xvii. Finally, after having performed the steps described above, a digital image file of the object can be generated using the χ mod (r) data values (by themselves or in combination with other image data). In any final step or intermediate step involving the production of chi(r), the noise outside the object of interest can be removed. Also, as mentioned in step xi, the object FOV can be returned to the original FOV such that the matrix size is once again N x , N y  and N z , without loss of any information. Still further, as shown in  FIG. 6 , if desired, a susceptibility weighted magnitude mask can be generated from the χ mod (r) data values and be used to generate a pure SWI image. 
       Optional Ideal Filter 
       [0023]    In situations where the field caused by a structure having a well defined shape and unit susceptibility (or of a known susceptibility value) is known with great accuracy, then a k-space inverse filter, specific to that shape, can be defined by dividing the Fourier transform of the source geometry with the Fourier transform of the known field map: 
         [0000]    
       
         
           
             
               
                 G 
                 ideal 
               
                
               
                 [ 
                 k 
                 ] 
               
             
             = 
             
               
                 FT 
                  
                 
                   [ 
                   
                     
                       Geometry 
                       object 
                     
                      
                     
                       ( 
                       r 
                       ) 
                     
                   
                   ] 
                 
               
               
                 FT 
                  
                 
                   [ 
                   
                     Δ 
                      
                     
                         
                     
                      
                     
                       B 
                        
                       
                         ( 
                         r 
                         ) 
                       
                     
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]      FIGS. 4-5  depict a flow chart of the implementations of an “ideal” filter that can be used in the present invention for such situations. 
         [0024]    The primary assumption of the Born approximation, which is a pre-requisite for the linearity and superposition of fields when multiple objects are considered specifies that the induced magnetization in structures of different susceptibility is primarily due to the main external magnetic field B 0 . For example, when two structures A and B of different susceptibilities are placed in an external magnetic field B 0  in close proximity, it is assumed that ΔB A (r)∝χ A −B 0  due to A does not influence the induced magnetization in structure B or vice versa, i.e. ΔB B (r)∝χ B −B 0 . 
         [0025]    The advantage of this ideal filter approach is that it can be used to account for the finite field of view and discrete shape boundary conditions of the object in its definition, and hence can be used to obtain a highly accurate chi-map with minimal artifacts. This filter contains all the possible higher order terms (specific to the shape) which are ignored in previous works. Furthermore, G ideal (k) is defined discretely, where FT is the discrete Fourier Transform as opposed to G(k) which is defined analytically. This has the advantage of better dealing with finite sampling issues. Still further, once such a filter defined for a specific object shape, it can be used to find the susceptibility from phase of one or more objects of the same shape and size. 
         [0026]    Defining G ideal (k) for a given geometry can easily be done when the analytic expression for field perturbation due to that shape is known, like in the cases of standard symmetric geometries of spheres, cylinders or elipsoids. For an arbitrarily shaped object where an analytic expression for field perturbation is not known, ΔB(r) data could be obtained by preparing phantoms of that shape and measuring the resulting field perturbation from the MR phase data. Another method to obtain/estimate ΔB(r) involves numerically solving Maxwell&#39;s equations with boundary conditions for the specific object shape, using one of the standard Finite-difference-Time-domain computational techniques. Finally, one can consider the known object to be the entire brain or other structure of interest within it with some guess of the susceptibilities coming from a priori knowledge or the current SWIM approach with some smoothing or like modifications. 
         [0027]    Best results at defining G ideal (k) accurately are achieved when ΔB(r) of the object contain as little noise as possible. However, in cases where there is considerable noise present in ΔB(r), techniques like field fitting using an object-based model or modeling of the field in terms of polynomial functions can be used to remove noise from the ΔB(r) map of the object. 
         [0028]    This Ideal Filter can be used in connection with susceptibility mapping discussed above to image a composite structure containing many sub-structures. For example, it can be applied to a brain where different sub-cortical structures, sinuses, gray matter, white matter, arteries, veins constitute the sub-structures/geometry. Given the magnitude image and the field map (i.e., phase images: unwrapped or high pass filtered) of the brain, assuming that ideal filters for each of the sub-structure shape is available, G ideal  for each sub-structure or geometry can be applied individually to obtain the susceptibility value for that particular structure/geometry. Alternatively, a new G′ ideal  could be defined using the individual ideal filters for each sub structure. This can be a weighted summation of the individual filters (i.e., G′ ideal =Σ n W n G ideal-n , where n denotes the index of the sub-structure). 
         [0029]    Further optimization or regularization of G′ ideal  can, in some cases, improve results. For example, if the original G ideal-HighRes  is defined for a larger object-size, i.e., with smaller voxel dimensions, then a corresponding G ideal-LowRes-Estimate  can be defined from G ideal-HighRes  for an object of same shape but a smaller size, i.e., at a lower resolution. However, in cases where G ideal-LowRes-Estimate  is used, some regularization/filtering can reduce undesirable artifacts. Such artifacts arise because G ideal-LowRes-Estimate  is only an estimate of the actual ideal filter for that object size. Using this approach is advantageous when trying to speed up the susceptibility mapping process by using an already defined G ideal . 
         [0030]    As various modifications could be made in the constructions and methods herein described and illustrated without departing from the scope of the invention, it is intended that all matter contained in the foregoing description or shown in the accompanying drawings shall be interpreted as illustrative rather than limiting. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims appended hereto and their equivalents. 
         [0031]    It should also be understood that when introducing elements of the present invention in the claims or in the above description of the preferred embodiment of the invention, the terms “comprising”, “applying”, and “using,” are intended to be open-ended and mean that there may be additional elements other than the listed elements. Moreover, use of identifiers such as first, second, and third should not be construed in a manner imposing time sequence between limitations unless such a time sequence is necessary to perform such limitations. Still further, the order in which the steps of any method claim that follows are presented should not be construed in a manner limiting the order in which such steps must be performed unless such order is necessary to perform such steps.