Direct parallel image reconstructions for spiral trajectories using GRAPPA.

The use of spiral trajectories is an efficient way to cover a desired k-space partition in magnetic resonance imaging (MRI). Compared to conventional Cartesian k-space sampling, it allows faster acquisitions and results in a slight reduction of the high gradient demand in fast dynamic scans, such as in functional MRI (fMRI). However, spiral images are more susceptible to off-resonance effects that cause blurring artifacts and distortions of the point-spread function (PSF), and thereby degrade the image quality. Since off-resonance effects scale with the readout duration, the respective artifacts can be reduced by shortening the readout trajectory. Multishot experiments represent one approach to reduce these artifacts in spiral imaging, but result in longer scan times and potentially increased flow and motion artifacts. Parallel imaging methods are another promising approach to improve image quality through an increase in the acquisition speed. However, non-Cartesian parallel image reconstructions are known to be computationally time-consuming, which is prohibitive for clinical applications. In this study a new and fast approach for parallel image reconstructions for spiral imaging based on the generalized autocalibrating partially parallel acquisitions (GRAPPA) methodology is presented. With this approach the computational burden is reduced such that it becomes comparable to that needed in accelerated Cartesian procedures. The respective spiral images with two- to eightfold acceleration clearly benefit from the advantages of parallel imaging, such as enabling parallel MRI single-shot spiral imaging with the off-resonance behavior of multishot acquisitions.     

Reconstruction of undersampled non-Cartesian data sets using pseudo-Cartesian GRAPPA in conjunction with GROG.

Most k-space-based parallel imaging reconstruction techniques, such as Generalized Autocalibrating Partially Parallel Acquisitions (GRAPPA), necessitate the acquisition of regularly sampled Cartesian k-space data to reconstruct a nonaliased image efficiently. However, non-Cartesian sampling schemes offer some inherent advantages to the user due to their better coverage of the center of k-space and faster acquisition times. On the other hand, these sampling schemes have the disadvantage that the points acquired generally do not lie on a grid and have complex k-space sampling patterns. Thus, the extension of Cartesian GRAPPA to non-Cartesian sequences is nontrivial. This study introduces a simple, novel method for performing Cartesian GRAPPA reconstructions on undersampled non-Cartesian k-space data gridded using GROG (GRAPPA Operator Gridding) to arrive at a nonaliased image. Because the undersampled non-Cartesian data cannot be reconstructed using a single GRAPPA kernel, several Cartesian patterns are selected for the reconstruction. This flexibility in terms of both the appearance and number of patterns allows this pseudo-Cartesian GRAPPA to be used with undersampled data sets acquired with any non-Cartesian trajectory. The successful implementation of the reconstruction algorithm using several different trajectories, including radial, rosette, spiral, one-dimensional non-Cartesian, and zig-zag trajectories, is demonstrated.     

Advances in locally constrained k-space-based parallel MRI.

In this article, several theoretical and methodological developments regarding k-space-based, locally constrained parallel MRI (pMRI) reconstruction are presented. A connection between Parallel MRI with Adaptive Radius in k-Space (PARS) and GRAPPA methods is demonstrated. The analysis provides a basis for unified treatment of both methods. Additionally, a weighted PARS reconstruction is proposed, which may absorb different weighting strategies for improved image reconstruction. Next, a fast and efficient method for pMRI reconstruction of data sampled on non-Cartesian trajectories is described. In the new technique, the computational burden associated with the numerous matrix inversions in the original PARS method is drastically reduced by limiting direct calculation of reconstruction coefficients to only a few reference points. The rest of the coefficients are found by interpolating between the reference sets, which is possible due to the similar configuration of points participating in reconstruction for highly symmetric trajectories, such as radial and spirals. As a result, the time requirements are drastically reduced, which makes it practical to use pMRI with non-Cartesian trajectories in many applications. The new technique was demonstrated with simulated and actual data sampled on radial trajectories.     

Varying kernel-extent gridding reconstruction for undersampled variable-density spirals.

Nonuniform, non-Cartesian k-space trajectories enable fast scanning with reduced motion and flow artifacts. In such cases, the data are usually convolved with a kernel and resampled onto a Cartesian grid before reconstruction. For trajectories such as undersampled variable-density spirals, the mainlobe width of the kernel for undersampled high spatial frequencies has to be larger to limit the amount of aliasing energy. Continuously varying the kernel extent is time consuming. By dividing k-space into several annuli and using appropriate mainlobe widths for each, the aliasing energy and noise can be reduced at the expense of lower resolution towards the edge of the field of view (FOV). Resolution can instead be preserved at the center of the FOV, which is expected to be free of artifacts, without any artifact reduction. The image reconstructed from each annulus can be deapodized separately. The method can be applied to most k-space trajectories used in MRI.     

Inherently self-calibrating non-Cartesian parallel imaging.

The use of self-calibrating techniques in parallel magnetic resonance imaging eliminates the need for coil sensitivity calibration scans and avoids potential mismatches between calibration scans and subsequent accelerated acquisitions (e.g., as a result of patient motion). Most examples of self-calibrating Cartesian parallel imaging techniques have required the use of modified k-space trajectories that are densely sampled at the center and more sparsely sampled in the periphery. However, spiral and radial trajectories offer inherent self-calibrating characteristics because of their densely sampled center. At no additional cost in acquisition time and with no modification in scanning protocols, in vivo coil sensitivity maps may be extracted from the densely sampled central region of k-space. This work demonstrates the feasibility of self-calibrated spiral and radial parallel imaging using a previously described iterative non-Cartesian sensitivity encoding algorithm.     

Off-resonance artifacts correction with convolution in k-space (ORACLE)

Off-resonance artifacts hinder the wider applicability of echo-planar imaging and non-Cartesian MRI methods such as radial and spiral. In this work, a general and rapid method is proposed for off-resonance artifacts correction based on data convolution in k-space. The acquired k-space is divided into multiple segments based on their acquisition times. Off-resonance-induced artifact within each segment is removed by applying a convolution kernel, which is the Fourier transform of an off-resonance correcting spatial phase modulation term. The field map is determined from the inverse Fourier transform of a basis kernel, which is calibrated from data fitting in k-space. The technique was demonstrated in phantom and in vivo studies for radial, spiral and echo-planar imaging datasets. For radial acquisitions, the proposed method allows the self-calibration of the field map from the imaging data, when an alternating view-angle ordering scheme is used. An additional advantage for off-resonance artifacts correction based on data convolution in k-space is the reusability of convolution kernels to images acquired with the same sequence but different contrasts.     

Parallel magnetic resonance imaging with adaptive radius in k-space (PARS): constrained image reconstruction using k-space locality in radiofrequency coil encoded data.

A parallel image reconstruction algorithm is presented that exploits the k-space locality in radiofrequency (RF) coil encoded data. In RF coil encoding, information relevant to reconstructing an omitted datum rapidly diminishes as a function of k-space separation between the omitted datum and the acquired signal data. The proposed method, parallel magnetic resonance imaging with adaptive radius in k-space (PARS), harnesses this physical property of RF coil encoding via a sliding-kernel approach. Unlike generalized parallel imaging approaches that might typically involve inverting a prohibitively large matrix for arbitrary sampling trajectories, the PARS sliding-kernel approach creates manageable and distributable independent matrices to be inverted, achieving both computational efficiency and numerical stability. An empirical method designed to measure total error power is described, and the total error power of PARS reconstructions is studied over a range of k-space radii and accelerations, revealing "minimal-error" conditions at comparatively modest k-space radii. PARS reconstructions of undersampled in vivo Cartesian and non-Cartesian data sets are shown and are compared selectively with traditional SENSE reconstructions. Various characteristics of the PARS k-space locality constraint (such as the tradeoff between signal-to-noise ratio and artifact power and the relationship with iterative parallel conjugate gradient approaches or nonparallel gridding approaches) are discussed.     

Decomposed direct matrix inversion for fast non-cartesian SENSE reconstructions.

A new k-space direct matrix inversion (DMI) method is proposed here to accelerate non-Cartesian SENSE reconstructions. In this method a global k-space matrix equation is established on basic MRI principles, and the inverse of the global encoding matrix is found from a set of local matrix equations by taking advantage of the small extension of k-space coil maps. The DMI algorithm's efficiency is achieved by reloading the precalculated global inverse when the coil maps and trajectories remain unchanged, such as in dynamic studies. Phantom and human subject experiments were performed on a 1.5T scanner with a standard four-channel phased-array cardiac coil. Interleaved spiral trajectories were used to collect fully sampled and undersampled 3D raw data. The equivalence of the global k-space matrix equation to its image-space version, was verified via conjugate gradient (CG) iterative algorithms on a 2x undersampled phantom and numerical-model data sets. When applied to the 2x undersampled phantom and human-subject raw data, the decomposed DMI method produced images with small errors (< or = 3.9%) relative to the reference images obtained from the fully-sampled data, at a rate of 2 s per slice (excluding 4 min for precalculating the global inverse at an image size of 256 x 256). The DMI method may be useful for noise evaluations in parallel coil designs, dynamic MRI, and 3D sodium MRI with fixed coils and trajectories.     

MRI using a concentric rings trajectory.

The concentric rings two-dimensional (2D) k-space trajectory provides an alternative way to sample polar data. By collecting 2D k-space data in a series of rings, many unique properties are observed. The concentric rings are inherently centric-ordered, provide a smooth weighting in k-space, and enable shorter total scan times. Due to these properties, the concentric rings are well-suited as a readout trajectory for magnetization-prepared studies. When non-Cartesian trajectories are used for MRI, off-resonance effects can cause blurring and degrade the image quality. For the concentric rings, off-resonance blur can be corrected by retracing rings near the center of k-space to obtain a field map with no extra excitations, and then employing multifrequency reconstruction. Simulations show that the concentric rings exhibit minimal effects due to T(2) (*) modulation, enable shorter scan times for a Nyquist-sampled dataset than projection-reconstruction imaging or Cartesian 2D Fourier transform (2DFT) imaging, and have more spatially distributed flow and motion properties than Cartesian sampling. Experimental results show that off-resonance blurring can be successfully corrected to obtain high-resolution images. Results also show that concentric rings effectively capture the intended contrast in a magnetization-prepared sequence.     

Double average parallel steady-state free precession imaging: optimized eddy current and transient oscillation compensation.

Balanced steady-state free precession (SSFP) imaging is sensitive to off-resonance effects, which can lead to considerable artifacts during a transient phase following magnetization preparation or steady-state interruption. In addition, nonlinear k-space encoding is required if contrast-relevant k-space regions need to be acquired at specific delays following magnetization preparation or for transient artifact reduction in cardiac-gated k-space segmented CINE imaging. Such trajectories are problematic for balanced SSFP imaging due to nonconstant eddy current effects and resulting disruption of the steady state.In this work, a novel acquisition strategy for balanced SSFP imaging is presented that utilizes scan time reduction by parallel imaging for optimized "double average" eddy current compensation and artifact reduction during the transient phase following steady-state storage and magnetization preparation. Double average parallel SSFP imaging was applied to k-space segmented CINE SSFP tagging as well as nongated centrically encoded SSFP imaging. Phantom and human studies exhibit substantial reduction in steady-state storage and eddy current artifacts while maintaining spatial resolution, signal-to-noise ratio, and similar total scan time of a standard SSFP acquisition. The proposed technique can easily be extended to other acquisition schemes that would benefit from nonlinear reordering schemes and/or rely on interruption of the balanced SSFP steady state.     

A brief review of parallel magnetic resonance imaging

Since the 1980s, the implementation of fast imaging methods and dedicated hardware for MRI scanners has reduced the image acquisition time from nearly an hour down to several seconds and has therefore enabled a widespread use of MRI in clinical diagnosis. Since this development, the greatest incremental gain in imaging speed has been provided by the development of parallel MRI (pMRI) techniques in late 1990s. Within the past 2 years, parallel imaging methods have become commercially available, which means that pMRI is now available for broad clinical use. In the clinical routine, virtually any MRI method can be enhanced by pMRI, allowing faster image acquisitions without any increased gradient system performance. In some cases pMRI can even result in a significant gain in image quality due to this faster acquisition. In this review article, the advantages and the disadvantages of pMRI in clinical applications are discussed and examples from many different daily applications are given.     

Improving GRAPPA using cross-sampled autocalibration data

In conventional generalized autocalibrating partially parallel acquisitions, the autocalibration signal (ACS) lines are acquired with a frequency-encoding direction in parallel to other undersampled lines. In this study, a cross sampling method is proposed to acquire the ACS lines orthogonal to the undersampled lines. This cross sampling method increases the amount of calibration data along the direction, where k-space is undersampled, and especially improves the calibration accuracy when a small number of ACS lines are acquired. The cross sampling method is implemented with swapped frequency and phase encoding gradients. In addition, an iterative coregistration method is also developed to correct the inconsistency between the ACS and undersampled data, which are acquired separately in two orthogonal directions. The same calibration and reconstruction procedure as conventional generalized autocalibrating partially parallel acquisitions is then applied to the corrected data to recover the unacquired k-space data and obtain the final image. Reconstruction results from simulations, phantom and in vivo human brain experiments have distinctly demonstrated that the proposed method, named cross-sampled generalized autocalibrating partially parallel acquisitions, can effectively reduce the aliasing artifacts of conventional generalized autocalibrating partially parallel acquisitions when very few ACS lines are acquired, especially at high outer k-space reduction factors.     

k-t BLAST reconstruction from non-Cartesian k-t space sampling.

Current implementations of k-t Broad-use Linear Acqusition Speed-up Technique (BLAST) require the sampling in k-t space to conform to a lattice. To permit the use of k-t BLAST with non-Cartesian sampling, an iterative reconstruction approach is proposed in this work. This method, which is based on the conjugate gradient (CG) method and gridding reconstruction principles, can efficiently handle data that are sampled along non-Cartesian trajectories in k-t space. The approach is demonstrated on prospectively gated radial and retrospectively gated Cartesian imaging. Compared to a sliding window (SW) reconstruction, the resulting image series exhibit lower artifact levels and improved temporal fidelity. The proposed approach thus allows investigators to combine the specific advantages of non-Cartesian imaging or retrospective gating with the acceleration provided by k-t BLAST.     

Artifact reduction in moving-table acquisitions using parallel imaging and multiple averages.

Two-dimensional (2D) axial continuously-moving-table imaging has to deal with artifacts due to gradient nonlinearity and breathing motion, and has to provide the highest scan efficiency. Parallel imaging techniques (e.g., generalized autocalibrating partially parallel acquisition GRAPPA)) are used to reduce such artifacts and avoid ghosting artifacts. The latter occur in T(2)-weighted multi-spin-echo (SE) acquisitions that omit an additional excitation prior to imaging scans for presaturation purposes. Multiple images are reconstructed from subdivisions of a fully sampled k-space data set, each of which is acquired in a single SE train. These images are then averaged. GRAPPA coil weights are estimated without additional measurements. Compared to conventional image reconstruction, inconsistencies between different subsets of k-space induce less artifacts when each k-space part is reconstructed separately and the multiple images are averaged afterwards. These inconsistencies may lead to inaccurate GRAPPA coil weights using the proposed intrinsic GRAPPA calibration. It is shown that aliasing artifacts in single images are canceled out after averaging. Phantom and in vivo studies demonstrate the benefit of the proposed reconstruction scheme for free-breathing axial continuously-moving-table imaging using fast multi-SE sequences.     

Sampling density compensation in MRI: rationale and an iterative numerical solution.

Data collection of MRI which is sampled nonuniformly in k-space is often interpolated onto a Cartesian grid for fast reconstruction. The collected data must be properly weighted before interpolation, for accurate reconstruction. We propose a criterion for choosing the weighting function necessary to compensate for nonuniform sampling density. A numerical iterative method to find a weighting function that meets that criterion is also given. This method uses only the coordinates of the sampled data; unlike previous methods, it does not require knowledge of the trajectories and can easily handle trajectories that "cross" in k-space. Moreover, the method can handle sampling patterns that are undersampled in some regions of k-space and does not require a post-gridding density correction. Weighting functions for various data collection strategies are shown. Synthesized and collected in vivo data also illustrate aspects of this method.     

Non-Cartesian data reconstruction using GRAPPA operator gridding (GROG).

A novel approach that uses the concepts of parallel imaging to grid data sampled along a non-Cartesian trajectory using GRAPPA operator gridding (GROG) is described. GROG shifts any acquired data point to its nearest Cartesian location, thereby converting non-Cartesian to Cartesian data. Unlike other parallel imaging methods, GROG synthesizes the net weight for a shift in any direction from a single basis set of weights along the logical k-space directions. Given the vastly reduced size of the basis set, GROG calibration and reconstruction requires fewer operations and less calibration data than other parallel imaging methods for gridding. Instead of calculating and applying a density compensation function (DCF), GROG requires only local averaging, as the reconstructed points fall upon the Cartesian grid. Simulations are performed to demonstrate that the root mean square error (RMSE) values of images gridded with GROG are similar to those for images gridded using the gold-standard convolution gridding. Finally, GROG is compared to the convolution gridding technique using data sampled along radial, spiral, rosette, and BLADE (a.k.a. periodically rotated overlapping parallel lines with enhanced reconstruction [PROPELLER]) trajectories.     

Recovery of phase inconsistencies in continuously moving table extended field of view magnetic resonance imaging acquisitions.

MR images formed using extended FOV continuously moving table data acquisition can have signal falloff and loss of lateral spatial resolution at localized, periodic positions along the direction of table motion. In this work we identify the origin of these artifacts and provide a means for correction. The artifacts are due to a mismatch of the phase of signals acquired from contiguous sampling fields of view and are most pronounced when the central k-space views are being sampled. Correction can be performed using the phase information from a periodically sampled central view to adjust the phase of all other views of that view cycle, making the net phase uniform across each axial plane. Results from experimental phantom and contrast-enhanced peripheral MRA studies show that the correction technique substantially eliminates the artifact for a variety of phase encode orders.     

2D-GRAPPA-operator for faster 3D parallel MRI.

When using parallel MRI (pMRI) methods in combination with three-dimensional (3D) imaging, it is beneficial to subsample the k-space along both phase-encoding directions because one can then take advantage of coil sensitivity variations along two spatial dimensions. This results in an improved reconstruction quality and therefore allows greater scan time reductions as compared to subsampling along one dimension. In this work we present a new approach based on the generalized autocalibrating partially parallel acquisitions (GRAPPA) technique that allows Fourier-domain reconstructions of data sets that are subsampled along two dimensions. The method works by splitting the 2D reconstruction process into two separate 1D reconstructions. This approach is compared with an extension of the conventional GRAPPA method that directly regenerates missing data points of a 2D subsampled k-space by performing a linear combination of acquired data points. In this paper we describe the theoretical background and present computer simulations and in vivo experiments.     

Self-calibrated spiral SENSE.

Current standard sensitivity-encoded parallel imaging (SENSE) utilizes a fully sampled low-resolution reference scan to estimate the coil sensitivities. This reference scan adds scan time and may introduce misregistration artifacts. The purpose of this study was to investigate the feasibility of estimating the coil sensitivities for spiral SENSE directly from an undersampled k-space center. The limited spatial frequencies of the coil sensitivities, and the undersampling beyond the Nyquist radius cause image artifacts. A point spread function (PSF) analysis and experiments on both phantoms and humans identified an optimal radius for the k-space center by minimizing these image artifacts. The preliminary data indicate that self-calibrated SENSE is as accurate as standard SENSE, which uses a fully sampled reference scan.