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...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Bandpass Sampling01:17

Bandpass Sampling

In signal processing, bandpass sampling is an effective technique for sampling signals that have most of their energy concentrated within a narrow frequency band. This type of signal is known as a bandpass signal. The key principle of bandpass sampling involves sampling the signal at a rate that is greater than twice the signal's bandwidth to prevent aliasing.
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...

You might also read

Related Articles

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

Sort by
Same author

Reply by Authors.

The Journal of urology·2020
Same author

Focal laser ablation as clinical treatment of prostate cancer: report from a Delphi consensus project.

World journal of urology·2019
Same author

Multiparametric MRI/ultrasound fusion-guided biopsy decreases detection of indolent cancer in African-American men.

Prostate cancer and prostatic diseases·2017
Same author

The prostate cancer prevention trial risk calculator 2.0 performs equally for standard biopsy and MRI/US fusion-guided biopsy.

Prostate cancer and prostatic diseases·2017
Same author

Utilization of multiparametric prostate magnetic resonance imaging in clinical practice and focal therapy: report from a Delphi consensus project.

World journal of urology·2016
Same author

Self-assembly of Silver Nanoparticles and Multiwall Carbon Nanotubes on Decomposed GaAs Surfaces.

Nanoscale research letters·2010
Same journal

Deep learning-based dose prediction to enhance planning efficiency in cervical brachytherapy with hybrid applicators.

Physics in medicine and biology·2026
Same journal

Corrigendum: Referenceless MR thermometry-a comparison of five methods (2017<i>Phys. Med. Biol</i>.<b>62</b>1-16).

Physics in medicine and biology·2026
Same journal

Corrigendum: Measured and Monte Carlo simulated electron backscatter to the monitor chamber for the varian TrueBeam linac (2016<i>Phys. Med. Biol</i>.<b>61</b>8779).

Physics in medicine and biology·2026
Same journal

Corrigendum: 3D range-modulator for scanned particle therapy: development, Monte Carlo simulations and experimental evaluation (2017<i>Phys. Med. Biol</i>.<b>62</b>7075).

Physics in medicine and biology·2026
Same journal

Recent progress in applications of computing to radiotherapy (ICCR 2016).

Physics in medicine and biology·2026
Same journal

Novel TMS coils designed using an inverse boundary element method.

Physics in medicine and biology·2026
See all related articles

Related Experiment Video

Updated: May 14, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

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

A K George1, Y Bresler

  • 1Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA. ashvin@alumni.illinois.edu

Physics in Medicine and Biology
|February 13, 2013
PubMed
Summary
This summary is machine-generated.

A new algorithm significantly speeds up fan-beam tomographic reconstruction by using sparse sampling grids. This method, inspired by parallel-beam techniques, reduces computations and runtimes by tenfold for computed tomography (CT) scanners.

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

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

Related Experiment Videos

Last Updated: May 14, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

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

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

Area of Science:

  • Medical Imaging
  • Computerized Tomography
  • Image Reconstruction

Background:

  • Fan-beam computed tomography (CT) is a crucial imaging modality.
  • Efficient reconstruction algorithms are vital for reducing scan times and computational load.
  • Existing fast algorithms are primarily designed for parallel-beam geometry.

Purpose of the Study:

  • To introduce a novel, fast algorithm for backprojecting fan-beam tomographic projections.
  • To achieve a significant reduction in computations and runtimes for fan-beam CT.
  • To extend the principles of fast reconstruction from parallel-beam to fan-beam geometry.

Main Methods:

  • Development of a divide-and-conquer algorithm for hierarchical aggregation of projections.
  • Utilizing sparse sampling grids to represent image data efficiently.
  • Novel analysis of fan-beam backprojection to characterize spatially-varying frequency content, enabling the use of non-Cartesian grids.

Main Results:

  • The algorithm reduces computations and actual runtimes by an order of magnitude for typical CT scanner configurations.
  • Demonstrates the feasibility of using sparse, non-Cartesian sampling grids in fan-beam reconstruction.
  • Overcomes the lack of a direct fan-beam equivalent to the projection-slice theorem.

Conclusions:

  • The proposed algorithm offers a substantial computational speedup for fan-beam CT reconstruction.
  • This advancement is achieved by adapting divide-and-conquer strategies and employing sparse sampling based on a new frequency analysis.
  • Represents a significant step forward in accelerating fan-beam tomographic imaging.