Share Email Print
cover

Proceedings Paper

New iterative gridding algorithm using conjugate gradient method
Author(s): Xuguang Jiang; Daniel Thedens
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Non-uniformly sampled data in MRI applications must be interpolated onto a regular Cartesian grid to perform fast image reconstruction using FFT. The conventional method for this is gridding, which requires a density compensation function (DCF). The calculation of DCF may be time-consuming, ambiguously defined, and may not be always reusable due to changes in k-space trajectories. A recently proposed reconstruction method that eliminates the requirement of DCF is block uniform resampling (BURS) which uses singular value decomposition (SVD). However, the SVD is still computationally intensive. In this work, we present a modified BURS algorithm using conjugate gradient method (CGM) in place of direct SVD calculation. Calculation of a block of grid point values in each iteration further reduces the computational load. The new method reduces the calculation complexity while maintaining a high-quality reconstruction result. For an n-by-n matrix, the time complexity per iteration is reduced from O(n*n*n) in SVD to O(n*n) in CGM. The time can be further reduced when we stop the iteration in CGM earlier according to the norm of the residual vector. Using this method, the quality of the reconstructed image improves compared to regularized BURS. The reduced time complexity and improved reconstruction result make the new algorithm promising in dealing with large-sized images and 3D images.

Paper Details

Date Published: 12 May 2004
PDF: 10 pages
Proc. SPIE 5370, Medical Imaging 2004: Image Processing, (12 May 2004); doi: 10.1117/12.535685
Show Author Affiliations
Xuguang Jiang, Univ. of Iowa (United States)
Daniel Thedens, Univ. of Iowa (United States)


Published in SPIE Proceedings Vol. 5370:
Medical Imaging 2004: Image Processing
J. Michael Fitzpatrick; Milan Sonka, Editor(s)

© SPIE. Terms of Use
Back to Top