A note on the iterative MRI reconstruction from nonuniform k-space data

International Journal of Biomedical Imaging

Volumn 2007, Issue , 2007, Pages

  Knopp, Tobias ^a   Kunis, Stefan ^b   Potts, Daniel ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS; IMAGE QUALITY; ITERATIVE METHODS; MAGNETIC RESONANCE IMAGING;

DATA SET; DENSITY COMPENSATION WEIGHTS; SPARSE MATRIX;

IMAGE RECONSTRUCTION;

EID: 34247202177     PISSN: 16874188     EISSN: 16874196     Source Type: Journal    
DOI: 10.1155/2007/24727     Document Type: Article

References (30)

1. S. Matej matej@mipg.upenn.edu J. A. Fessler fessler@umich.edu I. G. Kazantsev kazantsev@mipg.upenn.edu Iterative tomographic image reconstruction using Fourier-based forward and back-projectors. IEEE Transactions on Medical Imaging 23 4 2004 401 412
2. B. P. Sutton J. A. Fessler D. C. Noll A min-max approach to the nonuniform N-dimensional FFT for rapid iterative reconstruction of MR images. Proceedings of the 9th Annual Meeting of the International Society for Magnetic Resonance in Medicine (ISMRM '01) Scotland, UK 2001 763
3. B. P. Sutton bpsutton@umich.edu D. C. Noll J. A. Fessler Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities. IEEE Transactions on Medical Imaging 22 2 2003 178 188
4. K. P. Pruessmann M. Weiger P. Börnert P. Boesiger Advances in sensitivity encoding with arbitrary k-space trajectories. Magnetic Resonance in Medicine 46 4 2001 638 651
5. J. D. O'Sullivan A fast sinc function gridding algorithm for Fourier inversion in computer tomography. IEEE Transactions on Medical Imaging 4 4 1985 200 207
6. B. Desplanques Bart.Desplanques@rug.ac.be D. J. Cornelis E. Achten R. Van De Walle I. Lemahieu Iterative reconstruction of magnetic resonance images from arbitrary samples in k-space. IEEE Transactions on Nuclear Science 49 5, part 1 2002 2268 2273
7. S. Kunis D. Potts NFFT, Softwarepackage, C subroutine library. 2002-2006, http://www-user.tu-chemnitz.de/∼potts/nfft/
8. D. Potts G. Steidl M. Tasche J. J. Benedetto P. J. S. G. Ferreira Fast Fourier transforms for nonequispaced data: a tutorial. Modern Sampling Theory: Mathematics and Applications Birkhäuser Boston, Mass, USA 2001 247 270
9. G. Steidl steidl@math.uni-mannheim.de A note on fast Fourier transforms for nonequispaced grids. Advances in Computational Mathematics 9 3-4 1998 337 352
10. S. Kunis D. Potts Time and memory requirements of the nonequispaced FFT. Preprint 2006-01, Chemnitz University of Technology
11. R. F. Bass bass@math.uconn.edu K. Gröchenig karlheinz. groechenig@gsf.de Random sampling of multivariate trigonometric polynomials. SIAM Journal on Mathematical Analysis 36 3 2004 773 795
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 1996 1st
14. C. C. Paige M. A. Saunders LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software 8 1982 1 43 71
15. C. B. Barber H. Huhdanpaa Qhull, Softwarepackage. http://www.qhull.org/
16. V. Rasche V.Rasche@pfh.research.philips.com R. Proksa R. Sinkus P. Börnert H. Eggers Resampling of data between arbitrary grids using convolution interpolation. IEEE Transactions on Medical Imaging 18 5 1999 385 392
17. J. G. Pipe Reconstructing MR images from undersampled data: data-weighing considerations. Magnetic Resonance in Medicine 43 6 2000 867 875
18. Y. M. Kadah A. S. Fahmy R. E. Gabr K. Heberlein X. P. Hu Progressive magnetic resonance image reconstruction based on iterative solution of a sparse linear system. International Journal of Biomedical Imaging 49378 2006 2006 9 pages
19. H. Eggers T. Knopp D. Potts Field inhomogeneity correction based on gridding reconstruction. to appear in IEEE Transactions on Medical Imaging
20. K. Fourmont karsten.fourmont@math.uni-muenster.de Non-equispaced fast Fourier transforms with applications to tomography. Journal of Fourier Analysis and Applications 9 5 2003 431 450
21. J. A. Fessler fessler@umich.edu B. P. Sutton bpsutton@umich.edu Nonuniform fast Fourier transforms using min-max interpolation. IEEE Transactions on Signal Processing 51 2 2003 560 574
22. A. Dutt V. Rokhlin Fast Fourier transforms for nonequispaced data. SIAM Journal on Scientific Computing 14 6 1993 1368 1393
23. G. Beylkin On the fast Fourier transform of functions with singularities. Applied and Computational Harmonic Analysis 2 4 1995 363 381
24. A. J. W. Duijndam a.j.w.duijndam@ta.tudelft.nl M. A. Schonewille m.a.schonewille@ta.tudelft.nl Nonuniform fast Fourier transform. Geophysics 64 2 1999 539 551
25. J. Pelt D. Maoz A. Sternberg E. Leibowitz Fast computation of trigonometric sums with applications to frequency analysis of astronomical data. Proceedings of the Florence and George Wise Observatory, 25th Anniversary Symposium Astronomical Time Series Kluwer Academic Tel-Aviv, Isreal 1997 179 182
26. J. I. Jackson C. H. Meyer D. G. Nishimura A. Macovski Selection of a convolution function for Fourier inversion using gridding. IEEE Transactions on Medical Imaging 10 3 1991 473 478
27. N. Nguyen nnguyen@nmsu.edu Q. H. Liu qhliu@nmsu.edu The regular Fourier matrices and nonuniform fast Fourier transforms. SIAM Journal of Scientific Computing 21 1 1999 283 293
28. A. Nieslony G. Steidl steidl@math.uni-mannheim.de Approximate factorizations of Fourier matrices with nonequispaced knots. Linear Algebra and Its Applications 366 2003 337 351
29. G. E. Sarty R. Bennett R. W. Cox Direct reconstruction of non-cartesian k-space data using a nonuniform fast Fourier transform. Magnetic Resonance in Medicine 45 5 2001 908 915
30. H. G. Feichtinger K. Gröchenig T. Strohmer Efficient numerical methods in non-uniform sampling theory. Numerische Mathematik 69 1995 4 423 440