Related Experiment Video
Updated: Jul 8, 2026

10:44
Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging
Published on: June 21, 2024
The gridding method for image reconstruction by Fourier transformation
1Philips Res. Lab., Hamburg.
IEEE Transactions on Medical Imaging
|January 1, 1995
Summary
This study presents a computational method for signal reconstruction from Fourier transform samples. The technique offers a robust and efficient alternative for various imaging applications, including radio astronomy and medical imaging.
Area of Science:
- Computational imaging
- Signal processing
Background:
- Reconstructing signals from Fourier transform data is crucial in many scientific fields.
- Traditional interpolation methods can be error-prone due to noise and sampling limitations.
Purpose of the Study:
- To introduce a novel computational method for reconstructing n-dimensional signals from their sampled Fourier transforms.
- To provide a more accurate and efficient alternative to existing reconstruction techniques.
Main Methods:
- The method involves convolving the signal's Fourier transform with a window function on a Cartesian grid.
- Numerical computation of the convolution is followed by an inverse discrete Fourier transform.
- The final signal is obtained by dividing the result by the window function.
Main Results:
- The convolution's smoothing effect reduces errors compared to simple interpolation.
- The method is applicable to diverse reconstructive imaging modalities like radio astronomy, MRI, and CT.
- It offers a fast and accurate alternative to filtered backprojection.
Conclusions:
- The proposed computational method provides a robust approach for signal reconstruction from sampled Fourier transforms.
- Its versatility extends to various imaging applications and offers advantages over traditional methods.
- Variants of the method have further applications in signal resampling and transform computation.
Related Concept Videos
Continuous -time Fourier Transform
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
Reconstruction of Signal using Interpolation
Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Trigonometric Fourier series
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...

