Abstract
In magnetic resonance imaging (MRI), methods that use a non-Cartesian grid in
In magnetic resonance imaging (MRI), methods that use a non-Cartesian grid in
S. Matej, J. A. Fessler, and I. G. Kazantsev, “Iterative tomographic image reconstruction using Fourier-based forward and back-projectors,” IEEE Transactions on Medical Imaging, vol. 23, no. 4, pp. 401–412, 2004.
View at: Publisher Site | Google ScholarB. P. Sutton, J. A. Fessler, and D. C. Noll, “A min-max approach to the nonuniform N-dimensional FFT for rapid iterative reconstruction of MR images,” in Proceedings of the 9th Annual Meeting of the International Society for Magnetic Resonance in Medicine (ISMRM '01), p. 763, Scotland, UK, April 2001.
View at: Google ScholarB. P. Sutton, D. C. Noll, and J. A. Fessler, “Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities,” IEEE Transactions on Medical Imaging, vol. 22, no. 2, pp. 178–188, 2003.
View at: Publisher Site | Google ScholarK. P. Pruessmann, M. Weiger, P. Börnert, and P. Boesiger, “Advances in sensitivity encoding with arbitrary k-space trajectories,” Magnetic Resonance in Medicine, vol. 46, no. 4, pp. 638–651, 2001.
View at: Publisher Site | Google ScholarJ. D. O'Sullivan, “A fast sinc function gridding algorithm for Fourier inversion in computer tomography,” IEEE Transactions on Medical Imaging, vol. 4, no. 4, pp. 200–207, 1985.
View at: Google ScholarB. Desplanques, D. J. Cornelis, E. Achten, R. Van De Walle, and I. Lemahieu, “Iterative reconstruction of magnetic resonance images from arbitrary samples in k-space,” IEEE Transactions on Nuclear Science, vol. 49, no. 5, part 1, pp. 2268–2273, 2002.
View at: Publisher Site | Google ScholarS. Kunis and D. Potts, “NFFT, Softwarepackage, C subroutine library,” 2002–2006, http://www-user.tu-chemnitz.de/~potts/nfft/.
View at: Google ScholarD. Potts, G. Steidl, and M. Tasche, “Fast Fourier transforms for nonequispaced data: a tutorial,” in Modern Sampling Theory: Mathematics and Applications, J. J. Benedetto and P. J. S. G. Ferreira, Eds., pp. 247–270, Birkhäuser, Boston, Mass, USA, 2001.
View at: Google ScholarG. Steidl, “A note on fast Fourier transforms for nonequispaced grids,” Advances in Computational Mathematics, vol. 9, no. 3-4, pp. 337–352, 1998.
View at: Publisher Site | Google ScholarS. Kunis and D. Potts, “Time and memory requirements of the nonequispaced FFT,” Preprint 2006-01, Chemnitz University of Technology.
View at: Google ScholarR. F. Bass and K. Gröchenig, “Random sampling of multivariate trigonometric polynomials,” SIAM Journal on Mathematical Analysis, vol. 36, no. 3, pp. 773–795, 2004.
View at: Publisher Site | Google ScholarÅ. Björck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, Pa, USA, 1996.
Y. Saad, Iterative Methods for Sparse Linear Systems, PWS, Boston, Mass, USA, 1st edition, 1996.
C. C. Paige and M. A. Saunders, “LSQR: an algorithm for sparse linear equations and sparse least squares,” ACM Transactions on Mathematical Software, vol. 8, no. 1, pp. 43–71, 1982.
View at: Publisher Site | Google ScholarC. B. Barber and H. Huhdanpaa, “Qhull, Softwarepackage,” http://www.qhull.org/.
View at: Google ScholarV. Rasche, R. Proksa, R. Sinkus, P. Börnert, and H. Eggers, “Resampling of data between arbitrary grids using convolution interpolation,” IEEE Transactions on Medical Imaging, vol. 18, no. 5, pp. 385–392, 1999.
View at: Publisher Site | Google ScholarJ. G. Pipe, “Reconstructing MR images from undersampled data: data-weighing considerations,” Magnetic Resonance in Medicine, vol. 43, no. 6, pp. 867–875, 2000.
View at: Publisher Site | Google ScholarY. M. Kadah, A. S. Fahmy, R. E. Gabr, K. Heberlein, and X. P. Hu, “Progressive magnetic resonance image reconstruction based on iterative solution of a sparse linear system,” International Journal of Biomedical Imaging, vol. 2006, Article ID 49378, p. 9, 2006.
View at: Publisher Site | Google ScholarH. Eggers, T. Knopp, and D. Potts, “Field inhomogeneity correction based on gridding reconstruction,” to appear in IEEE Transactions on Medical Imaging.
View at: Google ScholarK. Fourmont, “Non-equispaced fast Fourier transforms with applications to tomography,” Journal of Fourier Analysis and Applications, vol. 9, no. 5, pp. 431–450, 2003.
View at: Publisher Site | Google ScholarJ. A. Fessler and B. P. Sutton, “Nonuniform fast Fourier transforms using min-max interpolation,” IEEE Transactions on Signal Processing, vol. 51, no. 2, pp. 560–574, 2003.
View at: Publisher Site | Google ScholarA. Dutt and V. Rokhlin, “Fast Fourier transforms for nonequispaced data,” SIAM Journal on Scientific Computing, vol. 14, no. 6, pp. 1368–1393, 1993.
View at: Publisher Site | Google ScholarG. Beylkin, “On the fast Fourier transform of functions with singularities,” Applied and Computational Harmonic Analysis, vol. 2, no. 4, pp. 363–381, 1995.
View at: Publisher Site | Google ScholarA. J. W. Duijndam and M. A. Schonewille, “Nonuniform fast Fourier transform,” Geophysics, vol. 64, no. 2, pp. 539–551, 1999.
View at: Publisher Site | Google ScholarJ. Pelt, “Fast computation of trigonometric sums with applications to frequency analysis of astronomical data,” in Proceedings of the Florence and George Wise Observatory, 25th Anniversary Symposium, D. Maoz, A. Sternberg, and E. Leibowitz, Eds., Astronomical Time Series, pp. 179–182, Kluwer Academic, Tel-Aviv, Isreal, January 1997.
View at: Google ScholarJ. I. Jackson, C. H. Meyer, D. G. Nishimura, and A. Macovski, “Selection of a convolution function for Fourier inversion using gridding,” IEEE Transactions on Medical Imaging, vol. 10, no. 3, pp. 473–478, 1991.
View at: Publisher Site | Google ScholarN. Nguyen and Q. H. Liu, “The regular Fourier matrices and nonuniform fast Fourier transforms,” SIAM Journal of Scientific Computing, vol. 21, no. 1, pp. 283–293, 1999.
View at: Publisher Site | Google ScholarA. Nieslony and G. Steidl, “Approximate factorizations of Fourier matrices with nonequispaced knots,” Linear Algebra and Its Applications, vol. 366, pp. 337–351, 2003.
View at: Publisher Site | Google ScholarG. E. Sarty, R. Bennett, and R. W. Cox, “Direct reconstruction of non-cartesian k-space data using a nonuniform fast Fourier transform,” Magnetic Resonance in Medicine, vol. 45, no. 5, pp. 908–915, 2001.
View at: Publisher Site | Google ScholarH. G. Feichtinger, K. Gröchenig, and T. Strohmer, “Efficient numerical methods in non-uniform sampling theory,” Numerische Mathematik, vol. 69, no. 4, pp. 423–440, 1995.
View at: Publisher Site | Google Scholar