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

442
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...
442
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

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

Linear Approximation in Frequency Domain

128
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....
128
Discrete Fourier Transform01:15

Discrete Fourier Transform

387
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...
387
Upsampling01:22

Upsampling

300
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
300
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

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

You might also read

Related Articles

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

Sort by
Same author

Identifying Anisotropic Structures of Non-Stained Melanoma Tissue From Images of Its Mueller Matrix Elements.

Experimental dermatology·2026
Same author

Endogenous Enzyme Stimulation of Localized Catalytic DNA Assembly for High-Contrast microRNA Imaging and Reliable Evaluation of Drug Resistance.

Analytical chemistry·2025
Same author

Interaction Between Bovine Serum Albumin and <i>Trans</i>-Resveratrol: Multispectroscopic Approaches and Molecular Dynamics Simulation.

Foods (Basel, Switzerland)·2025
Same author

Promoting research into vegetable oils by molecular simulation: recent progress and perspective.

Journal of the science of food and agriculture·2025
Same author

High-efficient nanoemulsions separation by surface manipulation of sands.

Journal of hazardous materials·2024
Same author

The wavenumber linearisation without calibration device for spectral-domain optical coherence tomography.

Journal of microscopy·2024

Related Experiment Video

Updated: Aug 30, 2025

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling
06:04

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling

Published on: January 17, 2025

704

Fourier spatial transform-based method of suppressing motion noises in OCTA.

Yue Zhang, Wanrong Gao, Chenxia Xie

    Optics Letters
    |September 1, 2022
    PubMed
    Summary

    This study introduces a novel adaptive denoising algorithm for optical coherence tomography angiography (OCTA) blood flow imaging. The method effectively reduces motion noise and improves image quality, enhancing signal-to-noise ratios.

    More Related Videos

    Picometer-Precision Atomic Position Tracking through Electron Microscopy
    15:04

    Picometer-Precision Atomic Position Tracking through Electron Microscopy

    Published on: July 3, 2021

    7.6K
    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
    06:25

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

    Published on: February 12, 2014

    8.5K

    Related Experiment Videos

    Last Updated: Aug 30, 2025

    Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling
    06:04

    Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling

    Published on: January 17, 2025

    704
    Picometer-Precision Atomic Position Tracking through Electron Microscopy
    15:04

    Picometer-Precision Atomic Position Tracking through Electron Microscopy

    Published on: July 3, 2021

    7.6K
    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
    06:25

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

    Published on: February 12, 2014

    8.5K

    Area of Science:

    • Biomedical Imaging
    • Optical Coherence Tomography Angiography (OCTA)
    • Medical Signal Processing

    Background:

    • Optical coherence tomography angiography (OCTA) blood flow imaging suffers from significant lateral noise due to physiological motion (e.g., heartbeat, respiration).
    • This motion-induced noise degrades image quality and hinders accurate analysis of microvascular structures.
    • Existing denoising methods may not adequately address the specific challenges of motion artifacts in OCTA.

    Purpose of the Study:

    • To develop and validate a novel adaptive denoising algorithm for OCTA blood flow imaging.
    • To utilize spatial frequency information of motion noise for artifact reduction.
    • To improve the signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) of OCTA images.

    Main Methods:

    • The proposed algorithm leverages spatial frequency characteristics of motion noise within the blood flow signal region.
    • It adaptively removes motion noise and corrects false connections in the OCTA data.
    • The algorithm's effectiveness was tested on finger blood flow OCTA images using different projection methods (mean and standard deviation).

    Main Results:

    • The adaptive denoising algorithm significantly improved SNR and CNR in OCTA images across various projection methods.
    • Mean projection demonstrated higher sensitivity to the algorithm, with average SNR and CNR improvements of 5.7 dB and 8.9 dB, respectively.
    • While standard deviation projection offered better initial visual quality, the algorithm enhanced both SNR and CNR.

    Conclusions:

    • The developed adaptive denoising algorithm is effective in reducing motion noise and artifacts in OCTA blood flow imaging.
    • The method offers a valuable tool for enhancing the diagnostic quality of OCTA, particularly for microvascular imaging.
    • The algorithm shows promise for improving quantitative analysis and visual interpretation of OCTA data.