Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Fast Fourier Transform

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

Trigonometric Fourier series

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

Computed Tomography

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 Transform

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

Convergence of Fourier Series

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

Inverse z-Transform by Partial Fraction Expansion

Inverse z-Transform by Partial Fraction Expansion

The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...

You might also read

Related Articles

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

Sort by

Same author

The potential of biology-guided radiation therapy in thoracic cancer: A preliminary treatment planning study.

Frontiers in oncology·2022

Same author

The potential of positron emission tomography for intratreatment dynamic lung tumor tracking: a phantom study.

Medical physics·2014

Same author

Emission-guided radiation therapy: biologic targeting and adaptive treatment.

Journal of the American College of Radiology : JACR·2010

Same author

Fourier properties of the fan-beam sinogram.

Medical physics·2010

Same author

Inverse-geometry volumetric CT system with multiple detector arrays for wide field-of-view imaging.

Medical physics·2007

Same author

A prototype table-top inverse-geometry volumetric CT system.

Medical physics·2006

Search research articles

Related Experiment Video

Updated: Jun 27, 2026

Four-Dimensional CT Analysis Using Sequential 3D-3D Registration

Four-Dimensional CT Analysis Using Sequential 3D-3D Registration

Published on: November 23, 2019

Fourier rebinning algorithm for inverse geometry CT.

Samuel R Mazin¹, Norbert J Pele

¹Department of Radiology, Stanford University, Stanford, California 94305, USA. smazin@stanford.edu

Medical Physics

|December 17, 2008

Summary

Fourier rebinning (FORE) offers a computationally efficient reconstruction algorithm for inverse geometry computed tomography (IGCT). This fast method demonstrates comparable resolution and noise performance to FDK in the center, making it suitable for IGCT imaging.

More Related Videos

Visualization of Failure and the Associated Grain-Scale Mechanical Behavior of Granular Soils under Shear using Synchrotron X-Ray Micro-Tomography

Visualization of Failure and the Associated Grain-Scale Mechanical Behavior of Granular Soils under Shear using Synchrotron X-Ray Micro-Tomography

Published on: September 29, 2019

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Related Experiment Videos

Last Updated: Jun 27, 2026

Four-Dimensional CT Analysis Using Sequential 3D-3D Registration

Four-Dimensional CT Analysis Using Sequential 3D-3D Registration

Published on: November 23, 2019

Visualization of Failure and the Associated Grain-Scale Mechanical Behavior of Granular Soils under Shear using Synchrotron X-Ray Micro-Tomography

Visualization of Failure and the Associated Grain-Scale Mechanical Behavior of Granular Soils under Shear using Synchrotron X-Ray Micro-Tomography

Published on: September 29, 2019

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Area of Science:

Medical Imaging
Computed Tomography
Image Reconstruction

Background:

Inverse geometry computed tomography (IGCT) utilizes a unique geometry with numerous X-ray sources and a smaller detector array.
The high volumetric coverage and resolution of IGCT generate substantial datasets, necessitating efficient 3D reconstruction algorithms.

Purpose of the Study:

To adapt and evaluate the Fourier rebinning (FORE) algorithm, originally for positron emission tomography, for IGCT applications.
To compare the performance of the FORE algorithm against traditional filtered backprojection (FDK)-type methods in IGCT.

Main Methods:

Implementation of the Defrise's Fourier rebinning (FORE) algorithm for IGCT data.
Comparative analysis of FORE reconstructions against averaged FDK reconstructions from individual source rows.

Main Results:

The FORE algorithm demonstrated an order of magnitude speed improvement over FDK for 11 source rows.
Both FORE and FDK methods showed similar resolution and noise characteristics in the center of the field-of-view.
FORE exhibited slight resolution degradation but reduced noise in the periphery of the field-of-view.

Conclusions:

Fourier rebinning (FORE) presents a computationally efficient and viable reconstruction method for IGCT.
FORE provides a good balance of speed and accuracy, suitable for handling large IGCT datasets.
The algorithm's performance characteristics suggest its potential for clinical application in IGCT.