Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Computed Tomography01:10

Computed Tomography

Tomography refers to imaging by sections. Computed tomography (CT) is a non-invasive imaging technique that uses computers to analyze several cross-sectional X-rays to reveal minute details about structures in the body.
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...
Continuous -time Fourier Transform01:11

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...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A fast fan-beam backprojection algorithm based on efficient sampling.

Physics in medicine and biology·2013
Same author

Globally convergent edge-preserving regularized reconstruction: an application to limited-angle tomography.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
Same author

Perfect blind restoration of images blurred by multiple filters: theory and efficient algorithms.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
Same author

Theoretical analysis of multispectral image segmentation criteria.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
Same author

Exact image deconvolution from multiple FIR blurs.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
Same author

O(N(2)log(2)N) filtered backprojection reconstruction algorithm for tomography.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
Same journal

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

DiffRES: Unleashing Text-to-Image Diffusion Models for Generative Referring Expression Segmentation without Information Leakage.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Location Matters: Frequency-Spatial Dual Space Adaptation for Cross-Domain Few-Shot Segmentation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Video

Updated: Jul 7, 2026

Using Tomoauto: A Protocol for High-throughput Automated Cryo-electron Tomography
11:33

Using Tomoauto: A Protocol for High-throughput Automated Cryo-electron Tomography

Published on: January 30, 2016

A fast and accurate Fourier algorithm for iterative parallel-beam tomography.

A H Delaney1, Y Bresler

  • 1Dept. of Electr. and Comput. Eng., Illinois Univ., Urbana, IL.

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|January 1, 1996
PubMed
Summary
This summary is machine-generated.

A new Fourier algorithm accelerates iterative tomographic reconstruction. This method, utilizing the fast Fourier transform (FFT), offers significant speed improvements for parallel-ray projections, enhancing image accuracy in sparse- and limited-angle scenarios.

More Related Videos

Dynamic Pore-scale Reservoir-condition Imaging of Reaction in Carbonates Using Synchrotron Fast Tomography
10:18

Dynamic Pore-scale Reservoir-condition Imaging of Reaction in Carbonates Using Synchrotron Fast Tomography

Published on: February 21, 2017

Related Experiment Videos

Last Updated: Jul 7, 2026

Using Tomoauto: A Protocol for High-throughput Automated Cryo-electron Tomography
11:33

Using Tomoauto: A Protocol for High-throughput Automated Cryo-electron Tomography

Published on: January 30, 2016

Dynamic Pore-scale Reservoir-condition Imaging of Reaction in Carbonates Using Synchrotron Fast Tomography
10:18

Dynamic Pore-scale Reservoir-condition Imaging of Reaction in Carbonates Using Synchrotron Fast Tomography

Published on: February 21, 2017

Area of Science:

  • Medical Imaging
  • Computational Science
  • Image Processing

Background:

  • Iterative tomographic reconstruction is crucial for medical imaging and other fields.
  • Existing algorithms can be computationally intensive and slow.
  • Accurate reconstruction requires handling various projection geometries and sampling rates.

Purpose of the Study:

  • To develop a novel, fast, and accurate Fourier algorithm for iterative tomographic reconstruction.
  • To improve computational efficiency compared to existing methods.
  • To enable effective reconstruction from parallel-ray projections at arbitrary angles.

Main Methods:

  • A series-expansion approach and operator framework were employed.
  • The conjugate gradient (CG) algorithm minimizes a regularized, spectrally weighted least-squares criterion.
  • The core iterative step is shown to be a 2-D discrete convolution, efficiently implemented using the fast Fourier transform (FFT).

Main Results:

  • The new algorithm achieves O(N^2 log N) operations per iteration for an NxN image, significantly faster than O(N^2 P) for other iterative methods.
  • Demonstrated effectiveness in sparse- and limited-angle tomography with simulated data.
  • Reconstruction quality is largely unaffected by stationary noise assumptions even with low to moderate nonstationary noise.

Conclusions:

  • The proposed Fourier algorithm provides a computationally efficient and accurate solution for iterative tomographic reconstruction.
  • It offers advantages for scenarios with sparse or limited angular sampling.
  • The algorithm's robustness to certain noise conditions makes it practical for real-world applications.