Related Experiment Video
Updated: Jul 7, 2026
11:34
High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
Published on: December 3, 2013
A high-speed reconstruction from projections using direct Fourier method with optimized parameters-an experimental
IEEE Transactions on Medical Imaging
|January 1, 1990
Summary
This study introduces a hybrid spline-linear interpolation for the direct Fourier method (DFM) in image reconstruction. Optimized parameters improve reconstruction quality and computational efficiency for CT and MR tomography.
Area of Science:
- Medical Imaging
- Computational Science
Background:
- Direct Fourier Method (DFM) implementation faces challenges in image reconstruction.
- Optimizing interpolation and data processing is crucial for accurate tomographic imaging.
Purpose of the Study:
- To address DFM implementation issues by proposing a hybrid spline-linear interpolation.
- To determine optimal reconstruction parameters for balancing image quality and computational cost.
Main Methods:
- A hybrid spline-linear interpolation technique was developed for the DFM.
- Comprehensive simulations were conducted, focusing on interpolation, radial density, filtering, and inverse Fourier transformation.
- Noiseless and noisy input data scenarios were analyzed.
Main Results:
- Optimal reconstruction parameters were identified for a priori defined image resolutions.
- The proposed method enhances reconstruction quality while managing computational expenses.
- Computational requirements of DFM with different interpolation schemes were compared for CT and MR tomography.
Conclusions:
- The hybrid spline-linear interpolation offers an effective solution for DFM implementation challenges.
- Parameter optimization significantly improves image reconstruction performance in tomographic applications.
- DFM's computational efficiency is comparable to or better than the convolution backprojection method for specific applications.
Related Concept Videos
01:10Reconstruction 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...
01:10Fast 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...
01:18Aliasing
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
01:21Convergence 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...
01:15Discrete 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...
01:20Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...