Related Experiment Video

Updated: Jul 7, 2026

Using Synchrotron Radiation Microtomography to Investigate Multi-scale Three-dimensional Microelectronic Packages
08:46

Using Synchrotron Radiation Microtomography to Investigate Multi-scale Three-dimensional Microelectronic Packages

Published on: April 13, 2016

Direct fourier reconstruction in fan-beam tomography

H Peng, H Stark

    IEEE Transactions on Medical Imaging
    |January 1, 1987
    PubMed

    More Related Videos

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

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

    Published on: February 21, 2017

    Computed Tomography-guided Time-domain Diffuse Fluorescence Tomography in Small Animals for Localization of Cancer Biomarkers12:24

    Computed Tomography-guided Time-domain Diffuse Fluorescence Tomography in Small Animals for Localization of Cancer Biomarkers

    Published on: July 17, 2012

    Related Concept Videos

    Electron Microscope Tomography and Single-particle Reconstruction01:07

    Electron Microscope Tomography and Single-particle Reconstruction

    Transmission electron microscopy (TEM) can be used to determine the 3D structure of biological samples with the help of techniques such as electron microscope tomography and single-particle reconstruction. While single-particle reconstruction can examine macromolecules and macromolecular complexes in vitro conditions only, tomography permits the study of cell components or small cells in vivo.
    Electron Tomography
    Electron tomography can be performed either in TEM or STEM (scanning transmission...
    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...
    Discrete Fourier Transform01:15

    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...
    Trigonometric Fourier series01:17

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