Effects of polar sampling in k‐space
- 1 December 1996
- journal article
- research article
- Published by Wiley in Magnetic Resonance in Medicine
- Vol. 36 (6) , 940-949
- https://doi.org/10.1002/mrm.1910360617
Abstract
Magnetic resonance imaging allows numerous k-space sampling schemes such as cartesian, polar, spherical, and other non-rectilinear trajectories. Non-rectilinear MR acquisitions permit fast scan times and can suppress motion artifacts. Still, these sampling schemes may adversely affect the image characteristics due to aliasing. Here, the Fourier aliasing effects of uniform polar sampling, i.e., equally spaced radial and azimuthal samples, are explained from the principal point spread function (PSF). The principal PSF is determined by assuming equally spaced concentric ring samples in k-space. The radial effects such as replication, smearing, truncation artifacts, and sampling requirements, are characterized based on the PSF.Keywords
This publication has 18 references indexed in Scilit:
- Analytical resolution and noise characteristics of linearly reconstructed magnetic resonance data with arbitraryk‐space samplingMagnetic Resonance in Medicine, 1995
- Selection of a convolution function for Fourier inversion using gridding (computerised tomography application)IEEE Transactions on Medical Imaging, 1991
- Spiral sampling: theory and an application to magnetic resonance imagingJournal of the Optical Society of America A, 1988
- NMR imaging with a rotary field gradientJournal of Magnetic Resonance (1969), 1986
- Rapid data-acquisition technique for nmr imaging by the projection-reconstruction methodJournal of Magnetic Resonance (1969), 1984
- Sampling theorems in polar coordinatesJournal of the Optical Society of America, 1979
- Image reconstruction using polar sampling theoremsApplied Optics, 1979
- The Main Beam and Ring Lobes of an East-West Rotation-Synthesis ArrayThe Astrophysical Journal, 1973
- Image reconstruction from finite numbers of projectionsJournal of Physics A: Mathematical, Nuclear and General, 1973
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965