Table of Contents Author Guidelines Submit a Manuscript
International Journal of Biomedical Imaging
Volume 2007 (2007), Article ID 24727, 9 pages
http://dx.doi.org/10.1155/2007/24727
Research Article

A Note on the Iterative MRI Reconstruction from Nonuniform k-Space Data

1Institute of Mathematics, University of Lübeck, Lübeck 23538, Germany
2Department of Mathematics, Chemnitz University of Technology, Chemnitz 09107, Germany

Received 18 January 2006; Revised 7 November 2006; Accepted 16 January 2007

Academic Editor: David L. Wilson

Copyright © 2007 Tobias Knopp et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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 · View at Google Scholar
  2. B. 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.
  3. B. 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 · View at Google Scholar
  4. K. 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 · View at Google Scholar
  5. J. 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 Scholar
  6. B. 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 · View at Google Scholar
  7. S. Kunis and D. Potts, “NFFT, Softwarepackage, C subroutine library,” 2002–2006, http://www-user.tu-chemnitz.de/~potts/nfft/.
  8. D. 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 Scholar
  9. G. 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 · View at Google Scholar
  10. S. Kunis and D. Potts, “Time and memory requirements of the nonequispaced FFT,” Preprint 2006-01, Chemnitz University of Technology.
  11. R. 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 · View at Google Scholar
  12. Å. Björck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, Pa, USA, 1996.
  13. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS, Boston, Mass, USA, 1st edition, 1996.
  14. 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 · View at Google Scholar
  15. C. B. Barber and H. Huhdanpaa, “Qhull, Softwarepackage,” http://www.qhull.org/.
  16. V. 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 · View at Google Scholar
  17. J. 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 · View at Google Scholar
  18. Y. 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 · View at Google Scholar
  19. H. Eggers, T. Knopp, and D. Potts, “Field inhomogeneity correction based on gridding reconstruction,” to appear in IEEE Transactions on Medical Imaging.
  20. K. 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 · View at Google Scholar
  21. J. 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 · View at Google Scholar
  22. A. 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 · View at Google Scholar
  23. G. 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 · View at Google Scholar
  24. A. J. W. Duijndam and M. A. Schonewille, “Nonuniform fast Fourier transform,” Geophysics, vol. 64, no. 2, pp. 539–551, 1999. View at Publisher · View at Google Scholar
  25. J. 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.
  26. J. 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 · View at Google Scholar
  27. N. 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 · View at Google Scholar
  28. A. 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 · View at Google Scholar
  29. G. 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 · View at Google Scholar
  30. H. 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 · View at Google Scholar