Related Experiment Video
Updated: Jun 8, 2026
10:44
Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging
Published on: June 21, 2024
Two-dimensional image reconstruction from Fourier coefficients computed directly from zero crossings.
Applied Optics
|September 11, 2010
Summary
This study demonstrates a novel 2D image reconstruction method using Fourier coefficients derived directly from zero crossings. This approach enables efficient image rebuilding from sampled data, advancing digital imaging techniques.
Area of Science:
- Image processing
- Signal processing
- Computer vision
Background:
- Traditional image reconstruction often requires extensive data.
- Zero crossings offer a unique data representation for image analysis.
- Fourier analysis is a fundamental tool in signal and image processing.
Purpose of the Study:
- To demonstrate a novel method for two-dimensional (2D) image reconstruction.
- To utilize Fourier coefficients computed directly from zero crossings.
- To reconstruct images from sampled data efficiently.
Main Methods:
- Interpreting a 2D image as N(y) independent x-space lines.
- Computing 1D Fourier transforms for each line using Newton's formula from zero crossings.
- Applying inverse Fourier transforms to reconstruct each line.
- Arranging reconstructed lines to form the final 2D image.
Main Results:
- Successful demonstration of 2D image reconstruction from zero crossings.
- Each line spectrum contains N(x) Fourier coefficients.
- Reconstructed x-space lines are obtained by inverse Fourier transformation.
- The final image is assembled by arranging the reconstructed lines.
Conclusions:
- The proposed method offers an effective way to perform 2D image reconstruction.
- Direct computation of Fourier coefficients from zero crossings is feasible.
- This technique provides a new approach to image rebuilding from sampled data.
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:11Continuous -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...
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:17Trigonometric 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...
01:07Basic signals of Fourier Transform
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
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...