Rapid gridding reconstruction with a minimal oversampling ratio

被引:250
作者
Beatty, PJ [1 ]
Nishimura, DG [1 ]
Pauly, JM [1 ]
机构
[1] Stanford Univ, Dept Elect Engn, Magnet Resonance Syst Res Lab, Stanford, CA 94305 USA
关键词
convolution interpolation; gridding; kernel function; three-dimensional (3-D) reconstruction;
D O I
10.1109/TMI.2005.848376
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Reconstruction of magnetic resonance images from data not failing on a Cartesian grid is a Fourier inversion problem typically solved using convolution interpolation, also known as gridding. Gridding is simple and robust and has parameters, the grid oversampling ratio and the kernel width, that can be used to trade accuracy for computational memory and time reductions. We have found that significant reductions in computation memory and time can be obtained while maintaining high accuracy by using a minimal oversampling ratio, from 1.125 to 1.375, instead of the typically employed grid oversampling ratio of two. When using a minimal oversampling ratio, appropriate design of the convolution kernel is important for maintaining high accuracy. We derive a simple equation for choosing the optimal Kaiser-Bessel convolution kernel for a given oversampling ratio and kernel width. As well, we evaluate the effect of presampling the kernel, a common technique used to reduce the computation time, and find that using linear interpolation between samples adds negligible error with far less samples than is necessary with nearest-neighbor interpolation. We also develop a new method for choosing the optimal presampled kernel. Using a minimal oversampling ratio and presampled kernel, we are able to perform a three-dimensional (3-D) reconstruction in one-eighth the time and requiring one-third the computer memory versus using an oversampling ratio of two and a Kaiser-Bessel convolution kernel, while maintaining the same level of accuracy.
引用
收藏
页码:799 / 808
页数:10
相关论文
共 20 条
[1]   Reconstruction in diffraction ultrasound tomography using nonuniform FFT [J].
Bronstein, MM ;
Bronstein, AM ;
Zibulevsky, M ;
Azhari, H .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2002, 21 (11) :1395-1401
[2]  
Dutt A., 1993, SIAM J SCI COMPUT, V14, P1369
[3]   Nonuniform fast Fourier transforms using min-max interpolation [J].
Fessler, JA ;
Sutton, BP .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (02) :560-574
[4]   Accelerating the nonuniform fast Fourier transform [J].
Greengard, L ;
Lee, JY .
SIAM REVIEW, 2004, 46 (03) :443-454
[5]   FAST 3-DIMENSIONAL MAGNETIC-RESONANCE-IMAGING [J].
IRARRAZABAL, P ;
NISHIMURA, DG .
MAGNETIC RESONANCE IN MEDICINE, 1995, 33 (05) :656-662
[6]   SELECTION OF A CONVOLUTION FUNCTION FOR FOURIER INVERSION USING GRIDDING [J].
JACKSON, JI ;
MEYER, CH ;
NISHIMURA, DG ;
MACOVSKI, A .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1991, 10 (03) :473-478
[7]   Applications of second-order cone programming [J].
Lobo, MS ;
Vandenberghe, L ;
Boyd, S ;
Lebret, H .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 284 (1-3) :193-228
[8]  
LOBO MS, 1998, 2 ORDER CONE PROGRAM
[9]  
LOFBERG J, 2004, YALMIP, V3
[10]   Iterative next-neighbor regridding (INNG):: Improved reconstruction from nonuniformly sampled k-space data using rescaled matrices [J].
Moriguchi, H ;
Duerk, JL .
MAGNETIC RESONANCE IN MEDICINE, 2004, 51 (02) :343-352