The invention relates generally to parellel imaging methods and systems. In particular, the invention related to methods and systems incorporating highly efficient parallel imaging using second-order nonlinear fields as encoding gradients with no phase encoding.
Parallel imaging methods exploit the spatial encoding contained in independent RF coil profiles to perform image reconstruction from undersampled k-space data (1). Aliasing artifacts are removed using the spatial information of the coil profiles to fill in missing phase encode lines either in the image domain, as in SENSE (2), or in k-space, as in GRAPPA (3). Parallel imaging performance is evaluated based on the geometry factor, or g-factor, which maps the amount of noise amplification that occurs in each voxel as a result of the image reconstruction problem being underdetermined by linear dependence between the coil profiles (2,4). Extensive efforts have been invested into optimizing coil profile orthogonality for a given ROI (5) and into exploring parallel imaging with undersampled non-Cartesian k-space trajectories (6). But to date, scan acceleration has only been performed with data collected using linear gradient fields applied along X, Y, and Z. For the case of circumferentially distributed surface coils, we propose in this invention that a radially-symmetric gradient shape would be a better complement to the coil array than a linearly-varying gradient, thereby reducing the amount of data that must be acquired for imaging at a given resolution.
Gradient fields and RF coil profiles are based on fundamentally different physics and do not interfere with one another. Therefore they can be freely combined to form encoding functions that are optimized for parallel imaging (7). Linear imaging gradients create plane-wave encoding functions weighted by the coil sensitivity profile. Because these plane waves comprise the kernel of the Fourier Transform integral, linear gradients provide fast and straightforward image reconstruction via the FFT once k-space is fully populated (assuming Cartesian sampling). However, for practical applications of parallel imaging, linear gradients are not generally shaped so as to take maximum advantage of the spatial encoding inherent to surface coil profiles. Because of this, large numbers of independent coils are typically required to achieve a low g-factor at high acceleration factors (8). At exceptionally high acceleration factors such as R=6 or R=4×4, moving from 32 to 96 coils substantially lowers the g-factor, albeit at the expense of greatly increased hardware cost and complexity (9). However, at more practical reduction factors such as R=3, R=4, or even R=3×3, moving from 12 to 32 coils provides much more g-factor reduction than moving from 32 to 96 coils (9). As coil elements grow smaller and more numerous, mutual coupling is greatly compounded and the coil Q-ratio generally decreases. Also, while large arrays do offer signal-to-noise ratio improvements over volume coils, as the array size grows these gains are relegated to an ever-thinner band at periphery of the sample (10).
An alternative way to improve parallel imaging performance is by imaging at ultra-high field strengths such as 7T, where wave effects within the body dielectric cause a focusing of coil profiles, improving spatial localization and the ultimate achievable g-factor for a given acceleration factor (11). However, human imaging at 7T presently entails prohibitive costs and technical complexity arising from magnet design, B1 transmit inhomogeneity, RF specific absorption rate (SAR), and other challenges (12). Furthermore, such scanners are not yet widely available, especially in clinical settings.
Recently, non-bijective curvilinear gradients have been proposed as a way to achieve faster gradient switching and spatially-varying resolution that may be tailored to objects in the ROI. In Hennig et al (13,14), two multipolar fields are generated from the real and imaginary parts of the conformal mapping. Because this mapping preserves the local angle between the isocontours of the inputs x and y, the field shapes u and v are everywhere orthogonal (∀B1·∀B2=0) and may be used as frequency and phase encoding gradients, respectively. Since zn is analytic and satisfies Laplace's equation for all n, the shapes u and v are realizable in a physical gradient coil design. The resulting fields for a given n vary in polarity with angular location and grow as rn, where r is the distance from the center. An array of surface coils provides spatial information to resolve the remaining angular ambiguity. The reduced B0 excursion over the bore of the scanner may permit faster gradient switching times for the same dB0/dt as compared with linear gradients, potentially allowing for faster imaging without violating safety limits for peripheral nerve stimulation. However, the relatively flat frequency isocontours at the center of the FOV result in pronounced blurring in this region.
Recent improvements in parallel imaging have been driven by the use of greater numbers of independent surface coils placed so as to minimize aliasing along the phase encode direction. However the gains from increasing the number of coils diminish as coil coupling problems begin to dominate and the ratio of acceleration gain to expense for multiple receiver chains becomes prohibitive. In this invention, we redesigned the spatial encoding strategy used in order to gain efficiency, achieving a gradient encoding scheme that is complementary to the spatial encoding provided by the receiver coils. This approach leads to “O-Space” imaging, wherein the spatial encoding gradient shapes are tailored to an existing surface coil array, making more efficient use of the spatial information contained in the coil profiles. In its simplest form, for each acquired echo the Z2 spherical harmonic is used to project the object onto sets of concentric rings, while the X and Y gradients are used to offset this projection within the imaging plane. This invention is presented, algorithms are introduced for image reconstruction, and the results reveal that O-Space encoding achieves high efficiency compared to Cartesian parallel imaging, suggesting that O-Space imaging holds great potential for highly accelerated scanning.
In summary, the invention provides the combination of one or more of the following aspects:
In the O-Space approach of this invention, parallel imaging performance is optimized using linear combinations of multiple spherical harmonics to form gradient shapes tailored to the spatial information contained in the coil profiles (15). In principle, arbitrary gradient shapes can be chosen for each successive echo to obtain different projections of the object. In its most general form, one begins with an array of surface coil profiles, assesses their spatial encoding ability, and then designs a nonlinear gradient encoding scheme that is maximally complementary to the coil array. In a typical circumferential coil array, the profiles vary smoothly throughout the FOV, but the regions of peak sensitivity are relatively localized in angular regions near each coil. A circumferential array therefore provides more encoding in the angular direction than in the radial direction, a fact that has not been exploited by gradient encoding schemes in the past.
According to an embodiment of the invention, we used a combination of the Z2 spherical harmonic and the X and Y linear gradients to image the axial plane. This choice of gradients is motivated by two factors:
In this approach, conventional phase encoding is discarded and replaced by projection acquisitions with the center of the Z2 function shifted off-center using the X and Y gradients. With each acquired echo, the object is projected onto a set of frequency isocontour rings that are concentric about a different center placement (CP) in the FOV, suggesting the term “O-Space imaging.” By shifting the Z2 quadratic shape off-center, it is ensured that there are enough overlapping isocontours from different projections at the center of the FOV to resolve features in this region.
The Fourier transform of an echo obtained in the presence of a radially-symmetric gradient yields a projection of the object onto a set of rings centered on the applied readout gradient. With radial localization provided by the gradients, the surface coils are ideally positioned to provide spatial localization in the angular direction. Furthermore, as will be shown in the results section, since the readout gradient provides spatial encoding in two dimensions, rather than just one as in Cartesian trajectories, additional encoding is provided by increasing the gradient strength and sampling the echo more densely with essentially no impact on the imaging time. In Cartesian parallel imaging, densely sampling the echo increases resolution in the x-direction but does not reduce the amount of aliasing in the phase encode direction. This is the primary impediment to achieving high acceleration factors.
To achieve radial frequency encoding we image in the axial plane and apply a Z2 dephase/rephase readout gradient. The radially-symmetric Z2 gradient is translated to the desired location in the FOV (center placement) using linear gradients and a B0 offset to complete the square, as shown in
where ρ(x,y) is the object, C1(x,y) is the receive coil sensitivity, (xm, ym) specifies the CP, GZ2 is the strength of the Z2 spherical harmonic in Hz/cm2. Gradient strengths GX and GY are chosen such that GX=−GZ2xm and GY=−GZ2ym in Hz/cm. Echoes formed using different CPs during successive TRs comprise a dataset from which the image is reconstructed. In the discrete case, the integral kernel can be represented as a projection matrix Am,n,t at time point t for the lth coil and mth CP. The echoes and encoding functions from multiple CPs and coils are stacked to produce a single matrix equation:
s=Aρ
If radius rm is defined relative to each CP, the integral may be recast in polar coordinates:
With the choice of
the inner integral assumes the form of the Fourier transform:
The inverse Fourier transform of the echo now yields Sm,l(u), the projection of the object along the isocontours encircling the mth CP. The projection specifies the amount of energy in the coil profile-weighted object that is smeared around ring-like regions that decrease in width with increasing rm (as in
Because the encoding function is not in the form of a Fourier integral kernel, the data do not reside in k-space. Consequently, image reconstruction cannot be achieved using k-space density compensation and re-gridding approaches similar to those employed in non-Cartesian imaging with linear gradients. Because of this fact, image reconstruction is performed by directly solving the matrix equation s=Aρ by one of two methods: a spatial domain algorithm based on the projections and a frequency domain algorithm based on the echoes.
When projections are obtained using the discrete Fourier transform, each point in the projection Sm,l[u] corresponds to the sum of the object intensity at all voxels lying within a band that can be approximated as the uth isofrequency ring. If the point spread function of the quadratic gradient is approximated as a discrete band of frequencies, then for an Ns-point Fourier transform there exist Ns isofrequency rings, where Ns is the number of samples taken during readout.
The radius of the outermost ring specified by rmax=√{square root over (BW/GZ2)} where BW is the sampling bandwidth. The sum over all voxels lying within a given ring is weighted by the lth surface coil profile at each point in that ring,
When the object and coil profiles are represented in vector form, the set of all ring-domain equations may be vertically concatenated to form a single matrix equation accounting for all Ns rings, M center placements, and L coils:
S[u]=[C·W]ρ=Eρ
where · denotes the dot product and W is a sparse matrix whose uth row weights each voxel according to its contribution to the uth ring of a given CP. The simplest version of W contains ones for each voxel lying within the uth ring and zeroes elsewhere. For an N×N reconstruction, the encoding matrix E is of dimension [Ns×M×L, N×N]. Direct inversion of this matrix is challenging for practical matrix sizes, but the sparsity of the matrix can be exploited by a version of the conjugate gradient algorithm known as LSQR (17) that is available as a function call in M
The spatial-domain solution amounts to back-projecting individual points in each projection onto the corresponding rings in the image. The difficulty with this approach is in accounting for the spatially-varying, complex point spread function (PSF) of each applied gradient shape. The PSF is not the same for all voxels lying between two frequency iscontours, particularly for the innermost rings where r approaches zero. The radial Gibbs ringing of the PSF due to convolution with the Fourier transform of the acquisition window boxcar only further complicates matters.
These obstacles can be surmounted by directly solving the integral equation s=Aρ in the frequency (echo) domain using the Kaczmarz iterative projection algorithm—also known as the Algebraic Reconstruction Technique (ART)—a row-action method that has found application in computed tomography and cryo-electron microscopy (18). This algorithm compares each echo time point with the inner product of the appropriate row of the projection matrix, denoted am,n,t, with the nth iterate of the image estimator. The difference between these scalars weights the amount of basis function am,n,t which is added to the estimator going into the next iteration:
The algorithm typically converges in only a few iterations. The entire projection matrix—spanning all time points, coils, and center placements—is too large to fit in memory, precluding the use of LSQR as a M
It should be noted that the true shape of each “ring” can be obtained by Fourier transforming each NS×N2 block of the encoding matrix along the temporal (column) direction. These image-domain matrices can be assembled into an equation for the unknown image using the projection data (i.e., FT of the echoes). This version of the encoding matrix can be sparsified by truncating all values falling below a certain threshold, leaving only the point spread function in the vicinity of each ring. With the sparse encoding matrix able to be stored in memory all at once, LSQR would present an attractive alternative to Kaczmarz for reconstructing the image.
Methods
Simulations were used to address four items. First, LSQR/image-domain reconstructions were used to quickly explore a variety of center placement schemes to find one that provides efficient O-Space encoding. Second, once a CP scheme had been chosen, Kaczmarz/frequency-domain reconstructions were used to compare O-Space and SENSE reconstructions over a wide range of acceleration factors. Third, Kaczmarz reconstructions were used to investigate the degradation of O-Space and SENSE reconstructions in the presence of increasing amounts of noise. Fourth, Kaczmarz simulations were used to investigate the effects of increased ring density on the resolution of O-Space images.
Two phantoms were used for each simulation: a low-noise axial brain image (
Simulated 128×128 reconstructions were performed to determine a highly-efficient center placement scheme within the FOV for datasets consisting of 32 and 16 echoes (21). By analogy to Cartesian parallel imaging, this corresponds to 4-fold and 8-fold undersampling, respectively. A variety of coil geometries were also considered, ranging from 8 to 32 circumferentially-distributed loop coils, for whose B-fields an exact analytical expression exists in the magnetostatic limit (22). Reconstructions were performed in the image domain using the projections of the sample about each CP (1D FT of each echo). For simplicity and computational efficiency, a ring approximation to the true PSF was used in which each voxel lying between frequency isocontours was averaged evenly over all voxels enclosed between the two contours. This results in a highly sparse image-domain encoding matrix that is less memory-intensive than the frequency-domain encoding matrix. CP schemes were evaluated based on the minimum mean squared error using the LSQR reconstruction as compared with the phantom.
Once a highly-efficient CP scheme was chosen, the Kaczmarz algorithm was used to perform more accurate reconstructions by directly solving the frequency-domain matrix representation of the signal equation for both simulated and acquired echoes. O-Space reconstructions were compared to SENSE reconstructions for R=4, R=8, and R=16; for the R=4 case, the reconstructions were then compared in the presence of varying amounts of noise. Noise amplification in the SENSE reconstructions was mitigated using Tikhonov regularization via the truncated SVD of the aliasing matrix (23).
Uncorrelated Gaussian noise was added to the phantom prior to multiplication by each of the 8 coil profiles used in the simulations. The noise standard deviation was scaled relative to the mean intensity in the phantom. Noise correlations between the coil channels were neglected for the purposes of this study and will be treated in future work. It is expected that these correlations will similarly impact both conventional Cartesian SENSE reconstruction and the proposed O-Space approach.
To explore the effects of ring density on resolution, the gradient strength and the number of readout points (Ns) were sequentially increased while extra channel noise was injected into the echoes to model the increased sampling BW.
For proof of concept, experimental data were collected on a 4.7T Bruker animal magnet (Billerica, Mass.) operating at 4T (total bore diameter=310 mm) with a Bruker Avance console. The system is equipped with dynamic shimming updating (DSU) on all first and second-order gradients that can be triggered from within a pulse sequence (24).
To avoid radial aliasing in O-Space, the sampling bandwidth and Z2 gradient strength GZ2 were chosen so that the outermost frequency ring did not fall within the object for a particular CP:
BW≧rmax2GZ2
In practice, even with the Z2 coil set to full strength over a 50 ms echo, most of the sampled rings lay outside the phantom, leading to suboptimal encoding, specific to this gradient set but not to the approach.
Results
The center placement scheme yielding the minimum mean squared error reconstruction in LSQR simulations is displayed in
In the R=4 Kaczmarz reconstructions with 5% noise, O-Space images displayed comparable resolution and slightly lower noise levels as compared with SENSE images (
When the acceleration factor is held constant at R=4 and the noise level is varied (
By performing Kaczmarz reconstructions of point sources at different locations in the FOV, we calculated the PSF of our chosen CP scheme. To isolate the effects of the gradient encoding alone, a single coil with uniform sensitivity was used. As expected, for each CP the source blurs along a ring that has the CP at its origin (
As expected, increased ring density within the phantom contributes to substantial improvements in resolution. The 128-ring O-Space reconstructions show extensive blurring and background non-uniformity at both R=8 (
Volume-coil datasets acquired with the dynamic shimming Z2 gradient consisted of 64 CPs distributed around the center of the FOV, a 65th echo using just the Z2 gradient, and an FID with no applied gradients to monitor scanner frequency drift. The reconstruction in
This application is a 371 of PCT Patent Application PCT/US2009/006544 filed Dec. 14, 2009, which claims the benefit of US Provisional Application 61/121927 filed Dec. 12, 2008.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US2009/006544 | 12/14/2009 | WO | 00 | 6/9/2011 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2010/068299 | 6/17/2010 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5132621 | Kang et al. | Jul 1992 | A |
5610521 | Zou et al. | Mar 1997 | A |
5939883 | Green et al. | Aug 1999 | A |
5998999 | Richard et al. | Dec 1999 | A |
6029081 | DeMeester et al. | Feb 2000 | A |
6029082 | Srinivasan et al. | Feb 2000 | A |
6229310 | Green et al. | May 2001 | B1 |
6316941 | Fujita et al. | Nov 2001 | B1 |
6396271 | Burl et al. | May 2002 | B1 |
6624633 | Zou et al. | Sep 2003 | B1 |
6636040 | Eydelman | Oct 2003 | B1 |
6876199 | Hardy et al. | Apr 2005 | B2 |
7084629 | Monski et al. | Aug 2006 | B2 |
7123008 | Damadian et al. | Oct 2006 | B1 |
7176688 | Sato | Feb 2007 | B2 |
7375521 | Damadian et al. | May 2008 | B1 |
7391213 | Watkins et al. | Jun 2008 | B2 |
7495443 | Leussler et al. | Feb 2009 | B2 |
7573432 | Eydelman et al. | Aug 2009 | B1 |
7747310 | Misic et al. | Jun 2010 | B2 |
7750630 | Van Helvoort et al. | Jul 2010 | B2 |
7800368 | Vaughan et al. | Sep 2010 | B2 |
7885704 | Misic | Feb 2011 | B2 |
7911209 | Alradady et al. | Mar 2011 | B2 |
8111067 | Damadian et al. | Feb 2012 | B1 |
8193812 | Pinkerton et al. | Jun 2012 | B2 |
8198892 | Doyle | Jun 2012 | B2 |
8244017 | Chun et al. | Aug 2012 | B2 |
20020101241 | Chui | Aug 2002 | A1 |
20040220468 | Watkins et al. | Nov 2004 | A1 |
20040236209 | Misic et al. | Nov 2004 | A1 |
20040239324 | Hardy et al. | Dec 2004 | A1 |
20050099179 | Monski et al. | May 2005 | A1 |
20080129292 | Leussler et al. | Jun 2008 | A1 |
20080129298 | Vaughan et al. | Jun 2008 | A1 |
20080275332 | Alradady et al. | Nov 2008 | A1 |
20090076378 | Misic | Mar 2009 | A1 |
20090079432 | Pinkerton et al. | Mar 2009 | A1 |
20090237079 | Van Helvoort et al. | Sep 2009 | A1 |
20100142823 | Wang et al. | Jun 2010 | A1 |
20100256480 | Bottomley et al. | Oct 2010 | A1 |
20100271020 | Doyle | Oct 2010 | A1 |
20110125005 | Misic | May 2011 | A1 |
20110163751 | Pinkerton et al. | Jul 2011 | A1 |
20110241675 | Constable et al. | Oct 2011 | A1 |
20110241683 | Nnewihe et al. | Oct 2011 | A1 |
20120062230 | Vaughan et al. | Mar 2012 | A1 |
20120068704 | Popescu | Mar 2012 | A1 |
20120223709 | Schillak et al. | Sep 2012 | A1 |
Number | Date | Country | |
---|---|---|---|
20110241675 A1 | Oct 2011 | US |
Number | Date | Country | |
---|---|---|---|
61121927 | Dec 2008 | US |