## A New Solution to the Gridding Problem (2002)

Venue: | In Proceedings of SPIE Medical Imaging |

Citations: | 2 - 0 self |

### BibTeX

@INPROCEEDINGS{Kadah02anew,

author = {Yasser M. Kadah},

title = {A New Solution to the Gridding Problem},

booktitle = {In Proceedings of SPIE Medical Imaging},

year = {2002}

}

### OpenURL

### Abstract

Image reconstruction from nonuniformly sampled frequency domain data is an important problem that arises in computed imaging. The current reconstruction techniques suffer from fundamental limitations in their model and implementation that result in blurred reconstruction and/or artifacts. Here, we present a new approach for solving this problem that relies on a more realistic model and involves an explicit measure for the reconstruction accuracy that is optimized iteratively. The image is assumed piecewise constant to impose practical display constraints using pixels. We express the mapping of these unknown pixel values to the available frequency domain values as a linear system. Even though the system matrix is shown to be dense and too large to solve for practical purposes, we observe that applying a simple orthogonal transformation to the rows of this matrix converts the matrix into a sparse format. The transformed system is subsequently solved using the conjugate gradient method. The proposed method is applied to reconstruct images of a numerical phantom as well as actual magnetic resonance images using spiral sampling. The results support the theory and show that the computational load of this method is similar to that of other techniques. This suggests its potential for practical use.

### Citations

85 | Selection of a convolution function for Fourier inversion using gridding
- Jackson, Meyer, et al.
- 1991
(Show Context)
Citation Context ...( k x , k y ) n, m ( x xn , y ym ) e dxdy, + − π = ∫∫∑∑α ⋅ Π − − ⋅ (2) −∞−∞n= 0 m= 0 F( k , k ) = Sinc( w k ) ⋅ Sinc( w k ) x y x x y y 1 1 − N M − ∑∑ n= 0 m= 0 n m − j2π ( k x + k y ) x n y m α ⋅e . =-=(3)-=- Here wx and wy correspond to the half of the pixel width in x and y directions. Hence, given the available arbitrarily located samples in the k-space, we can express the above equation as a linear sy... |

50 |
A fast sinc function gridding algorithm for Fourier invenion in computer tomogrnphy. lEEE Tmns. Med. Imaging hCI-4
- O'Sullivan
(Show Context)
Citation Context ...Consequently, the continuous Fourier transform of f(x,y) can be obtained as, which reduces to, ∞ ∞ N −1 M −1 n, m j 2 ( kx x k y y) F( k x , k y ) n, m ( x xn , y ym ) e dxdy, + − π = ∫∫∑∑α ⋅ Π − − ⋅ =-=(2)-=- −∞−∞n= 0 m= 0 F( k , k ) = Sinc( w k ) ⋅ Sinc( w k ) x y x x y y 1 1 − N M − ∑∑ n= 0 m= 0 n m − j2π ( k x + k y ) x n y m α ⋅e . (3) Here wx and wy correspond to the half of the pixel width in x and ... |

46 | Conjugate Direction Methods in Optimization - Hestenes - 1980 |

38 | Sampling density compensation in MRI: rationale and an iterative numerical solution. Magn Reson Med - JG, Menon - 1999 |

32 | The gridding method for image reconstruction by Fourier transformation - Schomberg, Timmer |

27 | On the optimality of the gridding reconstruction algorithm - Sedarat, Nishimura |

21 | Reconstruction of MR images from data acquired on a general non-regular grid by pseudoinverse calculation - Walle, Barrett, et al. - 2000 |

20 | Resampling of data between arbitrary grids using convolution interpolation - Rasche, Proksa, et al. - 1999 |

20 | An optimal and efficient new gridding algorithm using singular value decomposition - Rosenfeld - 1998 |

12 | Algebraic reconstruction for magnetic resonance imaging under B0 inhomogeneity - Kadah, Hu - 1998 |

10 |
Macovski A. Fast spiral coronary artery imaging. Magn Reson Med
- Meyer, Hu, et al.
- 1992
(Show Context)
Citation Context ...ar system unchanged while taking advantage of this property, we multiply by the Fourier transformation matrix and its inverse such that, � � � � � H H H b = A v = A ⋅ H ⋅ H ⋅v = ( H ⋅ A ) ⋅V = M ⋅V , =-=(4)-=- � where V is the 1-D discrete Fourier transform of the 1-D listing of pixel values and the matrix M is has most of the energy in its rows compacted into only a few elements (yet not sparse). In order... |

5 | Real-time image reconstruction for spiral mri using fixed-point calculation - Liao - 2000 |

5 | Modified block uniform resampling (BURS) algorithm using truncated singular value decomposition: fast accurate gridding with noise and artifact reduction - Moriguchi, Wendt, et al. |

4 | Applying the uniform resampling (URS) algorithm to a lissajous trajectory: fast image reconstruction with optimal gridding - Moriguchi, Wendt, et al. |

4 | A method to measure arbitrary k-space trajectories for rapid mr imaging - Mason, Harshbarger, et al. - 1997 |