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

286
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...
286
Discrete Fourier Transform01:15

Discrete Fourier Transform

228
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...
228
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

237
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]...
237
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

304
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...
304
Computed Tomography01:10

Computed Tomography

4.4K
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...
4.4K
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

280
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
280

You might also read

Related Articles

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

Sort by
Same author

Dual-engineered extracellular vesicles enabling endothelial targeting and EphrinB2 delivery for pulp revascularization.

Journal of nanobiotechnology·2026
Same author

Porcine Deltacoronavirus M Protein Binds NLRP3 to Promote Inflammasome Assembly via Competition with TRIM31.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

ResSAT: enhancing spatial transcriptomics prediction from H&E-stained histology images with an interactive spot transformer.

Genome biology·2026
Same author

Characteristics of pulmonary perfusion and ventilation in healthy adults: a prospective observational study with phase-resolved functional lung magnetic resonance imaging.

BMC medical imaging·2026
Same author

Pseudo-obstruction on single-phase CTPA: unilateral pulmonary vein atresia as the cause of 50 years of hemoptysis.

BMC pulmonary medicine·2026
Same author

Enhanced functional mitochondrial donation through glucose-responsive antioxidant microcarrier-engineered native-like MSCs accelerates diabetic wound healing.

Materials today. Bio·2026
Same journal

AVA: Automated Viewability Analysis for Ureteroscopic Intrarenal Surgery.

Proceedings of SPIE--the International Society for Optical Engineering·2026
Same journal

Kidney Endoscopy Video to Preoperative CT Alignment for Depth Estimation.

Proceedings of SPIE--the International Society for Optical Engineering·2026
Same journal

Deep learning‑based cell type prediction in lung tissue from brightfield histology using CODEX-derived labels.

Proceedings of SPIE--the International Society for Optical Engineering·2026
Same journal

Reconstructing physiological signals from fMRI across the adult lifespan.

Proceedings of SPIE--the International Society for Optical Engineering·2026
Same journal

Axially Swept Light-Sheet Microscopy using scattering and fluorescence contrast mechanisms.

Proceedings of SPIE--the International Society for Optical Engineering·2026
Same journal

Analytic Bounds on GAMLSS Model Variability of Normative White Matter Brain Charts.

Proceedings of SPIE--the International Society for Optical Engineering·2026
See all related articles

Related Experiment Video

Updated: Jun 13, 2025

Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging
10:44

Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging

Published on: June 21, 2024

453

Fourier Diffusion for Sparse CT Reconstruction.

Anqi Liu1, Grace J Gang2, J Webster Stayman1

  • 1Biomedical Engineering, Johns Hopkins University, Baltimore, MD, USA.

Proceedings of Spie--The International Society for Optical Engineering
|September 9, 2024
PubMed
Summary
This summary is machine-generated.

This study introduces a faster Fourier diffusion method for sparse CT reconstruction. The new approach significantly reduces computation time for generating high-quality CT images from limited data.

More Related Videos

Diffusion Imaging in the Rat Cervical Spinal Cord
10:46

Diffusion Imaging in the Rat Cervical Spinal Cord

Published on: April 7, 2015

11.7K
Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases
09:33

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

28.4K

Related Experiment Videos

Last Updated: Jun 13, 2025

Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging
10:44

Three-Dimensional Phase Resolved Functional Lung Magnetic Resonance Imaging

Published on: June 21, 2024

453
Diffusion Imaging in the Rat Cervical Spinal Cord
10:46

Diffusion Imaging in the Rat Cervical Spinal Cord

Published on: April 7, 2015

11.7K
Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases
09:33

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

28.4K

Area of Science:

  • Medical Imaging
  • Computational Imaging
  • Image Reconstruction

Background:

  • Sparse Computed Tomography (CT) reconstruction is crucial for novel imaging systems.
  • Deep learning, particularly diffusion models, shows promise but faces computational challenges.
  • Existing diffusion models are computationally expensive due to their recurrent structure.

Purpose of the Study:

  • To introduce a computationally efficient Fourier diffusion approach for sparse CT reconstruction.
  • To extend the Fourier diffusion technique for improved performance.
  • To evaluate the extended Fourier diffusion method in a simulated breast cone-beam CT (CBCT) system with sparse data.

Main Methods:

  • Developed a novel Fourier diffusion technique for image processing.
  • Reduced the number of time steps required compared to standard diffusion models.
  • Applied and evaluated the extended Fourier diffusion method in a simulated sparse-view breast CBCT scenario.

Main Results:

  • The Fourier diffusion approach allows for processing with significantly fewer time steps.
  • Demonstrated the effectiveness of the extended technique in a simulated sparse-view breast CBCT system.
  • Achieved efficient sparse CT reconstruction with reduced computational cost.

Conclusions:

  • The proposed Fourier diffusion method offers a computationally efficient alternative for sparse CT reconstruction.
  • This technique holds potential for improving the speed and feasibility of advanced imaging systems.
  • Further research can explore its application in various sparse-data imaging modalities.