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

Fast Fourier Transform01:10

Fast Fourier Transform

415
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...
415
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

121
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
121
Discrete Fourier Transform01:15

Discrete Fourier Transform

355
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...
355
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

410
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...
410
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

111
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
111
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

275
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
275

You might also read

Related Articles

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

Sort by
Same author

WHO grade 3 pediatric meningioma: a systematic review of clinical features and patient-level analysis of prognostic factors.

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

ZAP-X self-shielding gyroscopic radiosurgery: a scoping review of technical characteristics and early clinical experience.

Journal of clinical neuroscience : official journal of the Neurosurgical Society of Australasia·2026
Same author

Laterally Oscillating Trajectory for Undersampling Slices: LOTUS.

Magnetic resonance in medicine·2026
Same author

Development and First-in-Human Translation of Hyperpolarized [1-<sup>13</sup>C]Alpha-Ketoglutarate MR Spectroscopy in the Brain.

Sensors (Basel, Switzerland)·2026
Same author

Clinical examination of musculoskeletal groin pain: a simple protocol for hernia surgeons (Groin-MAP).

Hernia : the journal of hernias and abdominal wall surgery·2026
Same author

Optic Pathway Glioma in Adults: A Systematic Review and Individual Patient-Level Analysis of Clinical Characteristics and Prognostic Factors.

Cancers·2026

Related Experiment Video

Updated: Aug 6, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.1K

Optimization in the space domain for density compensation with the nonuniform FFT.

Nicholas Dwork1, Daniel O'Connor2, Ethan M I Johnson3

  • 1Biomedical Informatics and Radiology, University of Colorado Anschutz Medical Campus, Aurora, CO 80045, USA.

Magnetic Resonance Imaging
|March 19, 2023
PubMed
Summary

This study introduces a new algorithm for density compensation in non-uniform Discrete Fourier Transform (DFT) imaging. The method improves image reconstruction quality by considering the point spread function over entire regions.

Keywords:
Density compensationGriddingNUFFT

More Related Videos

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
09:01

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques

Published on: April 4, 2017

8.7K
Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

10.9K

Related Experiment Videos

Last Updated: Aug 6, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.1K
Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
09:01

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques

Published on: April 4, 2017

8.7K
Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

10.9K

Area of Science:

  • Medical Imaging
  • Signal Processing
  • Computational Science

Background:

  • Non-uniform Discrete Fourier Transform (DFT) is crucial for image reconstruction from non-uniformly sampled data.
  • Existing density compensation methods for non-uniform DFT are often suboptimal or limited in scope.
  • Accurate density compensation is vital for correcting variable sample density in Fourier-based imaging.

Purpose of the Study:

  • To develop an improved algorithm for generating density compensation values in non-uniform DFT.
  • To address limitations of current methods by considering the point spread function across extended image regions.
  • To enhance the quality of reconstructed images in modalities utilizing non-uniform Fourier sampling.

Main Methods:

  • A novel algorithm for density compensation value generation was developed.
  • The algorithm incorporates the point spread function over entire rectangular regions of the image domain.
  • The method was evaluated using a numerical phantom and real magnetic resonance imaging data.

Main Results:

  • The proposed density compensation method yields superior image reconstruction quality compared to standard techniques.
  • Reconstructed images demonstrated enhanced fidelity and accuracy.
  • The algorithm proved effective in both phantom studies and clinical abdominal and knee MRI.

Conclusions:

  • The developed algorithm provides a superior approach to density compensation for non-uniform DFT.
  • This method enhances image quality in non-uniform sampling scenarios.
  • The findings have significant implications for improving image reconstruction in various medical imaging modalities.