Related Experiment Video
Updated: Jul 10, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
A new method for PET image reconstruction using Fourier-Wavelet moment
Summary
A new feature-based method for positron emission tomography (PET) reconstruction uses Fourier-Wavelet moments for improved image quality. This non-regularization approach reduces computational cost and accelerates convergence, outperforming conventional methods.
Area of Science:
- Medical Imaging
- Signal Processing
- Computational Science
Background:
- Positron Emission Tomography (PET) imaging requires robust reconstruction algorithms.
- Conventional methods often rely on regularization, which can introduce artifacts or limit resolution.
- There is a need for non-regularization techniques that enhance reconstruction quality and efficiency.
Purpose of the Study:
- To introduce a novel non-regularization method for PET image reconstruction.
- To leverage a feature-based approach utilizing a Fourier-Wavelet basis.
- To improve reconstruction quality and computational efficiency in PET.
Main Methods:
- A feature-based reconstruction method employing a Fourier-Wavelet basis.
- Calculation of Fourier-Wavelet moments (FWM) from PET measurements.
- Utilization of an iterative approach with a row-action (RA)-like algorithm for accelerated convergence.
- Exploitation of the rotation invariance property of the Fourier-Wavelet basis to reduce computational load.
Main Results:
- The proposed method achieves good reconstruction quality in experimental comparisons.
- It demonstrates superior performance compared to conventional Maximum A Posteriori (MAP) methods.
- The use of Fourier-Wavelet basis and RA-like algorithm enhances efficiency and convergence.
Conclusions:
- The developed non-regularization method offers a promising alternative for PET reconstruction.
- The Fourier-Wavelet basis provides advantages in terms of computational cost and reconstruction quality.
- This approach represents a significant advancement in PET imaging technology.
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...
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...
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...
