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

Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

994
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...
994
Fast Fourier Transform01:10

Fast Fourier Transform

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

You might also read

Related Articles

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

Sort by
Same author

Isolated Lateral Calf Compartment Syndrome from a Sports Injury: A Case Report and Review of the Literature.

JBJS case connector·2026
Same author

Targeted multifidus muscle activation reduces fibrosis of multifidus muscle following intervertebral disc injury.

European spine journal : official publication of the European Spine Society, the European Spinal Deformity Society, and the European Section of the Cervical Spine Research Society·2024
Same author

Achievement of Target Gain Larger than Unity in an Inertial Fusion Experiment.

Physical review letters·2024
Same author

Rupture of a flow aneurysm secondary to spontaneous extracranial to intracranial revascularisation in the posterior fossa following radiation-induced vasculopathy for cerebellar tumour.

Child's nervous system : ChNS : official journal of the International Society for Pediatric Neurosurgery·2023
Same author

Reaching Ambulatory Older Adults with Educational Tools: Comparative Efficacy and Cost of Varied Outreach Modalities in Primary Care.

Journal of general internal medicine·2022
Same author

Lawson Criterion for Ignition Exceeded in an Inertial Fusion Experiment.

Physical review letters·2022

Related Experiment Video

Updated: Mar 2, 2026

Author Spotlight: An Efficient and Robust Software for Automated Fusion of Multiple Preclinical Imaging Modalities
07:13

Author Spotlight: An Efficient and Robust Software for Automated Fusion of Multiple Preclinical Imaging Modalities

Published on: October 27, 2023

1.7K

SU-E-J-93: Fourier Transform-Based Medical Image Registration.

J Luce1, G James1, M Hoggarth1

  • 1Loyola University Medical Center, Maywood, IL.

Medical Physics
|May 19, 2017
PubMed
Summary

This study shows a Fast Fourier Transform (FFT) based algorithm accurately registers 2D medical images with high precision. The FFT method is computationally efficient, offering a direct analytical solution for translational and rotational shifts.

Keywords:
Fourier transformsImage registrationMedical imaging

More Related Videos

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

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

Published on: November 23, 2019

8.5K
Multi-modal Pulmonary Imaging: Using Complementary Information from CT and Hyperpolarized 129Xe MRI to Evaluate Lung Structure-Function
02:09

Multi-modal Pulmonary Imaging: Using Complementary Information from CT and Hyperpolarized 129Xe MRI to Evaluate Lung Structure-Function

Published on: April 12, 2024

1.1K

Related Experiment Videos

Last Updated: Mar 2, 2026

Author Spotlight: An Efficient and Robust Software for Automated Fusion of Multiple Preclinical Imaging Modalities
07:13

Author Spotlight: An Efficient and Robust Software for Automated Fusion of Multiple Preclinical Imaging Modalities

Published on: October 27, 2023

1.7K
Four-Dimensional CT Analysis Using Sequential 3D-3D Registration
05:05

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

Published on: November 23, 2019

8.5K
Multi-modal Pulmonary Imaging: Using Complementary Information from CT and Hyperpolarized 129Xe MRI to Evaluate Lung Structure-Function
02:09

Multi-modal Pulmonary Imaging: Using Complementary Information from CT and Hyperpolarized 129Xe MRI to Evaluate Lung Structure-Function

Published on: April 12, 2024

1.1K

Area of Science:

  • Medical Imaging
  • Image Processing
  • Computational Anatomy

Background:

  • Accurate medical image registration is crucial for diagnosis and treatment planning.
  • Traditional methods often rely on iterative algorithms that can be computationally intensive.
  • A need exists for efficient and accurate image registration techniques.

Purpose of the Study:

  • To evaluate a Fast Fourier Transform (FFT) based pattern-matching algorithm for 2D medical image registration.
  • To assess the algorithm's accuracy for both translational and rotational image shifts.
  • To determine the computational efficiency of the FFT registration method.

Main Methods:

  • The algorithm utilizes the Fourier Transform (FT) and the Fourier shift theorem.
  • Image registration involves calculating the FT of images, performing normalized cross-correlation, and inverse FT.
  • Rotational registration is achieved using polar transformations of FT images.

Main Results:

  • The FFT algorithm demonstrated high accuracy, with recovered rotations within 0.1 degrees and translations within 0.5 mm for induced shifts up to +/-10 degrees and +/-10 mm.
  • Computational time for a 1024x1024 image was approximately 2.23 seconds.
  • The method provides an analytical solution, avoiding iterative convergence issues.

Conclusions:

  • FFT-based image registration is computationally efficient and highly accurate for 2D medical images.
  • The algorithm offers a distinct analytical solution, unlike iterative methods.
  • Accuracy is directly related to pixel size, with sub-pixel registration achievable by resizing images.