Abstract
Typically, the discrete Fourier transform (DFT) is performed on a sequence of data points that are equidistant on a given domain; however, it may be desirable to relax this constraint. In certain types of magnetic resonance imaging (MRI), there is the opportunity to take several unequally spaced samples simultaneously. In one MRI scheme known as “pure phase encoding”, each time a point is sampled in Fourier space it is possible to sample several nearby points very cheaply, which can improve the resulting image. Reconstructing an image from these points requires an inverse non-uniform DFT.
This paper presents a novel algorithm that uses numerical cubature with Delaunay triangulation to perform a 2D inverse DFT on unequally spaced data in the spatial frequency (k-space) domain. The additional data points contribute positively to spatial resolution and provide a better image in the same scan time. The intrinsic parallelism in the algorithm is exploited to carry out efficient implementation on an IBM SP parallel computer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B.J. Balcom, R.P. MacGregor, S.D. Beyea, D.P. Green, R.L Armstrong, T.W. Bremner. Single Point Ramped Imaging with T1 Enhancement (SPRITE). J. Magn. Res. A 1996 123, 131–134
M.de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer Verlag, New York, NY. 1997. p 181.
J. W. Cooley and J. W. Tukey. Algorithm for the machine computation of complex Fourier series. Math. Comp., 19 (1965), pp. 297–301.
Horowitz. A Version of Simpson’s Rule for Multiple Integrals. Journal of Computational and Applied Mathematics, (accepted 2001).
D. Nishimura. Magnetic Resonance Imaging. Stanford University. 1996.
S. S. Skiena. The Algorithm Design Manual. Telos, New York NY. 1997.
B. Wilkinson, M. Allen. Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Compters. Prentice Hall, Upper Saddle River, NJ. 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lizotte, D.J., Aubanel, E.E., Bhavsar, V.C. (2003). Nonuniform DFT Applications in MRI: A Novel Algorithm and Parallel Implementation. In: Kent, R.D., Sands, T.W. (eds) High Performance Computing Systems and Applications. The Springer International Series in Engineering and Computer Science, vol 727. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0288-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0288-3_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5005-7
Online ISBN: 978-1-4615-0288-3
eBook Packages: Springer Book Archive