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

Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
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...
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...
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...
Properties of DTFT I01:24

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...

You might also read

Related Articles

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

Sort by
Same author

Diffusing caveolin-1 scaffolds regulate mechanosignalling.

Nature cell biology·2026
Same author

Medical student attitudes and perceptions of Point of Care Ultrasound curriculum and assessment methods: a multisite survey.

Canadian medical education journal·2026
Same author

HDCluster: High-Degree Graph Clustering for Robust Analysis of Single Molecule Localization Microscopy.

bioRxiv : the preprint server for biology·2025
Same author

nERdy: network analysis of endoplasmic reticulum dynamics.

Communications biology·2025
Same author

Physician-in-the-Loop Active Learning in Radiology Artificial Intelligence Workflows: Opportunities, Challenges, and Future Directions.

AJR. American journal of roentgenology·2025
Same author

Hidden beneath the surface: what are the knowledge and skills for successful transition to practice.

CJEM·2025
Same journal

Change-Prior-Guided Unsupervised Change Detection of Heterogeneous Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

AgonicDreamer: Enhancing Multi-View Consistency in Text-to-3D Generation via Rectified Score Distillation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

BiCM-Prompt: Bidirectional Cross-Modal Prompt Tuning for Class-Incremental Learning on Multisource Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

GoP-based Quality Enhancement on Video Compression.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Align then Tensorize: Multi-Level Consistent Anchor Graph Learning for Scalable Multi-View Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Beyond Fidelity: Diverse Image Synthesis via Retrieval-Augmented Diffusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Videos

n-SIFT: n-dimensional scale invariant feature transform.

Warren Cheung1, Ghassan Hamarneh

  • 1Bioinformatics Program, University of British Columbia at the Centre for Molecular Medicine and Therapeutics, Vancouver, BC V5Z 4H4, Canada. wcheung@cmmt.ubc.ca

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|June 9, 2009
PubMed
Summary
This summary is machine-generated.

We introduce the n-dimensional scale invariant feature transform (n-SIFT) for robust feature extraction and matching in high-dimensional images. This method enables accurate correspondence between complex medical imaging datasets like 3D MRI and 4D CT scans.

Related Experiment Videos

Area of Science:

  • Computer Vision
  • Medical Imaging
  • Multidimensional Data Analysis

Background:

  • Scale Invariant Feature Transform (SIFT) is effective for 2D image feature extraction.
  • Extending SIFT to higher dimensions is crucial for complex data like 3D+time medical scans.
  • Existing methods may struggle with feature matching in arbitrary dimensional scalar images.

Purpose of the Study:

  • To propose and evaluate the n-dimensional scale invariant feature transform (n-SIFT) for feature extraction and matching.
  • To extend SIFT concepts to scalar images of arbitrary dimensionality.
  • To assess the performance of n-SIFT in automated multimodal medical image matching.

Main Methods:

  • Developed n-SIFT using hyperspherical coordinates for gradients and multidimensional histograms for feature vectors.
  • Extended 2D SIFT principles to handle arbitrary image dimensions.
  • Implemented and analyzed an automated multimodal medical image matching technique utilizing n-SIFT.

Main Results:

  • n-SIFT successfully extracts and matches salient features in arbitrary dimensional scalar images.
  • The method demonstrated accurate feature point correspondence between 3D MRI and dynamic 3D + time CT data.
  • Performance analysis confirmed the efficacy of n-SIFT in multimodal medical image registration.

Conclusions:

  • n-SIFT provides a robust solution for feature extraction and matching in high-dimensional data.
  • The proposed method enhances automated multimodal medical image analysis and registration accuracy.
  • n-SIFT represents a significant advancement for computer vision applications involving complex, multidimensional datasets.