A GRAPPA algorithm for arbitrary 2D/3D non‐Cartesian sampling trajectories with rapid calibration

摘要

Purpose GRAPPA is a popular reconstruction method for Cartesian parallel imaging, but is not easily extended to non‐Cartesian sampling. We introduce a general and practical GRAPPA algorithm for arbitrary non‐Cartesian imaging. Methods We formulate a general GRAPPA reconstruction by associating a unique kernel with each unsampled k‐space location with a distinct constellation, that is, local sampling pattern. We calibrate these generalized kernels using the Fourier transform phase shift property applied to fully gridded or separately acquired Cartesian Autocalibration signal (ACS) data. To handle the resulting large number of different kernels, we introduce a fast calibration algorithm based on nonuniform FFT (NUFFT) and adoption of circulant ACS boundary conditions. We applied our method to retrospectively under‐sampled rotated stack‐of‐stars/spirals in vivo datasets, and to a prospectively under‐sampled rotated stack‐of‐spirals functional MRI acquisition with a finger‐tapping task. Results We reconstructed all datasets without performing any trajectory‐specific manual adaptation of the method. For the retrospectively under‐sampled experiments, our method achieved image quality (i.e., error and g‐factor maps) comparable to conjugate gradient SENSE (cg‐SENSE) and SPIRiT. Functional activation maps obtained from our method were in good agreement with those obtained using cg‐SENSE, but required a shorter total reconstruction time (for the whole time‐series): 3?minutes (proposed) vs 15?minutes (cg‐SENSE). Conclusions This paper introduces a general 3D non‐Cartesian GRAPPA that is fast enough for practical use on today’s computers. It is a direct generalization of original GRAPPA to non‐Cartesian scenarios. The method should be particularly useful in dynamic imaging where a large number of frames are reconstructed from a single set of ACS data.