Modified block uniform resampling (BURS) algorithm using truncated singular value decomposition: Fast accurate gridding with noise and artifact reduction

The block uniform resampling (BURS) algorithm is a newly proposed regridding technique for nonuniformly‐sampled k‐space MRI. Even though it is a relatively computationally intensive algorithm, since it uses singular value decomposition (SVD), its procedure is simple because it requires neither a pre‐ nor a postcompensation step. Furthermore, the reconstructed image is generally of high quality since it provides accurate gridded values when the local k‐space data SNR is high. However, the BURS algorithm is sensitive to noise. Specifically, inaccurate interpolated data values are often generated in the BURS algorithm if the original k‐space data are corrupted by noise, which is virtually guaranteed to occur to some extent in MRI. As a result, the reconstructed image quality is degraded despite excellent performance under ideal conditions. In this article, a method is presented which avoids inaccurate interpolated k‐space data values from noisy sampled data with the BURS algorithm. The newly proposed technique simply truncates a series of singular values after the SVD is performed. This reduces the computational demand when compared with the BURS algorithm, avoids amplification of noise resulting from small singular values, and leads to image SNR improvements over the original BURS algorithm. Magn Reson Med 46:1189–1201, 2001. © 2001 Wiley‐Liss, Inc.

[1]  Per Christian Hansen,et al.  Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations , 1990, SIAM J. Sci. Comput..

[2]  Volker Rasche,et al.  Resampling of data between arbitrary grids using convolution interpolation , 1999, IEEE Transactions on Medical Imaging.

[3]  Jean A. Tkach,et al.  Improvement of spiral MRI with the measured k‐space trajectory , 1997, Journal of magnetic resonance imaging : JMRI.

[4]  J. Pauly,et al.  A homogeneity correction method for magnetic resonance imaging with time-varying gradients. , 1991, IEEE transactions on medical imaging.

[5]  D Rosenfeld,et al.  An optimal and efficient new gridding algorithm using singular value decomposition , 1998, Magnetic resonance in medicine.

[6]  C. Ahn,et al.  High-Speed Spiral-Scan Echo Planar NMR Imaging-I , 1986, IEEE Transactions on Medical Imaging.

[7]  H P Hetherington,et al.  A Method to measure arbitrary k‐space trajectories for rapid MR imaging , 1997, Magnetic resonance in medicine.

[8]  J A Frank,et al.  Simple correction method for k-space trajectory deviations in MRI. , 1998, Journal of magnetic resonance.

[9]  D M Spielman,et al.  Spiral imaging on a small‐bore system at 4.7t , 1995, Magnetic resonance in medicine.

[10]  Christopher J. Hardy,et al.  Broadband nuclear magnetic resonance pulses with two‐dimensional spatial selectivity , 1989 .

[11]  J L Duerk,et al.  Applying the uniform resampling (URS) algorithm to a lissajous trajectory: Fast image reconstruction with optimal gridding , 2000, Magnetic resonance in medicine.

[12]  D N Firmin,et al.  Real time blood flow imaging by spiral scan phase velocity mapping , 1994, Magnetic resonance in medicine.

[13]  J. Pipe,et al.  Sampling density compensation in MRI: Rationale and an iterative numerical solution , 1999, Magnetic resonance in medicine.

[14]  A. Macovski,et al.  Selection of a convolution function for Fourier inversion using gridding [computerised tomography application]. , 1991, IEEE transactions on medical imaging.

[15]  J. Schotland,et al.  Spectral quantitation by principal component analysis using complex singular value decomposition , 1999, Magnetic resonance in medicine.

[16]  HansenPer Christian Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank , 1990 .

[17]  John M. Pauly,et al.  Improved automatic off‐resonance correction without a field map in spiral imaging , 1997, Magnetic resonance in medicine.

[18]  Atsushi M. TAKAHASHIt Considerations for Using the Voronoi Areas as a k-Space Weighting Function , 1998 .

[19]  D. C. Noll,et al.  Multishot rosette trajectories for spectrally selective MR imaging , 1997, IEEE Transactions on Medical Imaging.

[20]  J. D. O'Sullivan,et al.  A Fast Sinc Function Gridding Algorithm for Fourier Inversion in Computer Tomography , 1985, IEEE Transactions on Medical Imaging.

[21]  Per Christian Hansen,et al.  Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank , 1990, SIAM J. Sci. Comput..

[22]  Mario Bertero,et al.  Introduction to Inverse Problems in Imaging , 1998 .

[23]  R. Hoge,et al.  Density compensation functions for spiral MRI , 1997, Magnetic resonance in medicine.

[24]  E M Stokely,et al.  A novel k‐space trajectory measurement technique , 1998, Magnetic resonance in medicine.

[25]  Bob S. Hu,et al.  Fast Spiral Coronary Artery Imaging , 1992, Magnetic resonance in medicine.