Related Experiment Video

Updated: Jun 26, 2026

Real-time Monitoring of High Intensity Focused Ultrasound (HIFU) Ablation of In Vitro Canine Livers Using Harmonic Motion Imaging for Focused Ultrasound (HMIFU)
07:38

Real-time Monitoring of High Intensity Focused Ultrasound (HIFU) Ablation of In Vitro Canine Livers Using Harmonic Motion Imaging for Focused Ultrasound (HMIFU)

Published on: November 3, 2015

[Design of the 2D-FFT image reconstruction software based on Matlab]

Hong-yu Xu1, Hong-zhi Wang

  • 1School of Medical Instrument and Food, USST, Shanghai.

Zhongguo Yi Liao Qi Xie Za Zhi = Chinese Journal of Medical Instrumentation
|January 6, 2009
PubMed
Summary

This study introduces a MATLAB implementation for 2D-Fast Fourier Transform (FFT) magnetic resonance imaging reconstruction. This tool enables independent data processing, enhancing image quality and diagnostic value.

More Related Videos

Blood Flow Imaging with Ultrafast Doppler05:57

Blood Flow Imaging with Ultrafast Doppler

Published on: October 14, 2020

Related Concept Videos

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...
Reconstruction of Signal using Interpolation01:10

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
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...
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...
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...