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

Accelerating Fluids

Accelerating Fluids

When a fluid is in constant acceleration, the pressure and buoyant force equations are modified. Suppose a beaker is placed in an elevator accelerating upward with a constant acceleration, a. In the beaker, assume there is a thin cylinder of height h with an infinitesimal cross-sectional area, ΔS.
The motion of the liquid within this infinitesimal cylinder is considered to obtain the pressure difference. Three vertical forces act on this liquid:

Maxwell-Boltzmann Distribution: Problem Solving

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by

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

Discrete Fourier Transform

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

Parseval's Theorem for Fourier transform

Parseval's Theorem for Fourier transform

Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...

You might also read

Related Articles

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

Sort by

Same author

MEMS-based near-infrared spectroscopy with AI for real-time breast cancer margin assessment.

Surgical oncology·2026

Same author

Assemblies, synapse clustering, and network topology interact with plasticity to explain structure-function relationships of the cortical connectome.

eLife·2025

Same author

Filter bank common spatial pattern and envelope-based features in multimodal EEG-fTCD brain-computer interfaces.

PloS one·2025

Same author

Community-based reconstruction and simulation of a full-scale model of the rat hippocampus CA1 region.

PLoS biology·2024

Same author

Genome-wide analysis of the biophysical properties of chromatin and nuclear proteins in living cells with Hi-D.

Nature protocols·2024

Same author

Synthesis of geometrically realistic and watertight neuronal ultrastructure manifolds for in silico modeling.

Briefings in bioinformatics·2024

Same journal

Deep Learning for Brain Tumour Analysis: A Systematic Review of CNN-Transformer Hybrids in Multimodal Imaging.

International journal of biomedical imaging·2026

Same journal

Brain Tumor Segmentation Using U-Net With ResNet50 Encoder for Enhanced MRI Analysis.

International journal of biomedical imaging·2026

Same journal

Generative AI-Driven CNN Framework for Enhanced Lung Cancer Detection, Prediction, and Treatment: A Novel Approach to Overcoming AI Limitations.

International journal of biomedical imaging·2026

Same journal

Enhancing the Generalizability of Deep Learning-Based Models for Lung Field Segmentation in Chest Radiographs Using Edge-Assisted Multiscale Feature Fusion.

International journal of biomedical imaging·2026

Same journal

Personalized PET Imaging in Gastric Cancer: An Umbrella Review of Meta-Analyses to Guide Radiopharmaceutical Selection and Clinical Indication.

International journal of biomedical imaging·2026

Same journal

Clinician-Centric Explainable Artificial Intelligence Framework for Medical Imaging Diagnostics: A Systematic Review.

International journal of biomedical imaging·2026

See all related articles

Search research articles

Related Experiment Videos

High Performance GPU-Based Fourier Volume Rendering.

Marwan Abdellah¹, Ayman Eldeib¹, Amr Sharawi¹

¹Biomedical Engineering Department, Cairo University, Giza 12613, Egypt.

International Journal of Biomedical Imaging

|April 14, 2015

Summary

This summary is machine-generated.

Fourier volume rendering (FVR) offers faster visualization for digital radiography than traditional methods. A new GPU-accelerated implementation using CUDA achieves significant speed-ups, enhancing FVR performance.

Related Experiment Videos

Area of Science:

Medical Imaging
Computer Graphics
Scientific Visualization

Background:

Fourier volume rendering (FVR) is a visualization technique for digital radiography.
FVR offers a time complexity of O(N^2 log N), faster than O(N^3) spatial domain methods.
FVR utilizes the Fourier projection-slice theorem, operating in the spectral domain.

Purpose of the Study:

To present a high-performance GPU-accelerated implementation of the FVR pipeline.
To leverage CUDA technology for efficient parallel processing on GPUs.
To improve the computational speed of FVR for digital radiography applications.

Main Methods:

Implementation of the FVR pipeline on CUDA-enabled GPUs.
Utilizing the computational power of modern GPU architectures.
Comparison against a single-threaded hybrid CPU-GPU implementation.

Main Results:

Achieved a speed-up of 117x compared to the hybrid implementation.
Demonstrated efficient execution of the rendering pipeline entirely on GPUs.
Showcased the effectiveness of GPU acceleration for FVR.

Conclusions:

The proposed GPU-accelerated FVR implementation significantly enhances performance.
CUDA technology enables efficient parallelization of FVR on GPUs.
This advancement offers a faster alternative for digital radiography visualization.