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

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

Discrete Fourier Transform

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

Linear Approximation in Frequency Domain

139
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....
139
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

374
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
374
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

594
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...
594
Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

2.7K
A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n)  to the number of categories (k).
2.7K

You might also read

Related Articles

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

Sort by
Same author

Enhancement of sleep slow wave activity using transcranial electrical stimulation with temporal interference: an interim analysis of the STRENGTHEN study.

Communications medicine·2026
Same author

Resonance-driven enhancement of sleep spindles using thalamic temporal interference stimulation.

bioRxiv : the preprint server for biology·2026
Same author

In vivo imaging of central nervous system fluid spaces using synchrotron radiation-based micro computed tomography.

Nature communications·2026
Same author

Network inequality through preferential attachment, triadic closure, and homophily.

Scientific reports·2026
Same author

Virtual prototyping of non-invasive spinal cord electrical stimulation targeting upper limb motor function.

bioRxiv : the preprint server for biology·2026
Same author

Experimental and numerical assessment of near-field exposure of a 60 GHZ communication antenna.

Radiation protection dosimetry·2026
Same journal

Intraoperative contrast-enhanced ultrasound features of progressive multifocal leukoencephalopathy: a case report.

Frontiers in neuroimaging·2026
Same journal

SliceMap: a binary classification-driven 2D pipeline for detecting discriminative candidate regions in brain MRI.

Frontiers in neuroimaging·2026
Same journal

Pulvinar pathways as skip connections in deep neural networks for vision.

Frontiers in neuroimaging·2026
Same journal

Evaluating the methodological quality of coordinate-based meta-analyses: the qual-CBMA checklist.

Frontiers in neuroimaging·2026
Same journal

Imaging research, diagnosis, and treatment advances of post-stroke cognitive impairment.

Frontiers in neuroimaging·2026
Same journal

Anatomically constrained volumetric smoothing enhances fMRI reliability while avoiding smoothing artifacts.

Frontiers in neuroimaging·2026
See all related articles

Related Experiment Video

Updated: Sep 19, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

2.6K

Efficient Fourier base fitting on masked or incomplete structured data.

Fariba Karimi1,2, Esra Neufeld1, Arya Fallahi1,2

  • 1The Foundation for Research on Information Technologies in Society (IT'IS), Zurich, Switzerland.

Frontiers in Neuroimaging
|June 19, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces a fast Fourier base fitting method for incomplete data, crucial for biomedical imaging. The technique efficiently reconstructs masked data, improving diagnostics for neurological conditions.

Keywords:
Fourier-base fittingbrain deformation dataimage processingmasked datareconstruction

More Related Videos

Concurrent EEG and Functional MRI Recording and Integration Analysis for Dynamic Cortical Activity Imaging
11:28

Concurrent EEG and Functional MRI Recording and Integration Analysis for Dynamic Cortical Activity Imaging

Published on: June 30, 2018

11.8K
Cortical Source Analysis of High-Density EEG Recordings in Children
09:32

Cortical Source Analysis of High-Density EEG Recordings in Children

Published on: June 30, 2014

21.5K

Related Experiment Videos

Last Updated: Sep 19, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

2.6K
Concurrent EEG and Functional MRI Recording and Integration Analysis for Dynamic Cortical Activity Imaging
11:28

Concurrent EEG and Functional MRI Recording and Integration Analysis for Dynamic Cortical Activity Imaging

Published on: June 30, 2018

11.8K
Cortical Source Analysis of High-Density EEG Recordings in Children
09:32

Cortical Source Analysis of High-Density EEG Recordings in Children

Published on: June 30, 2014

21.5K

Area of Science:

  • Signal Processing
  • Biomedical Engineering
  • Data Science

Background:

  • Masked or incomplete structured data present challenges in Fourier base fitting, particularly in biomedical image processing.
  • Data incompleteness complicates Fourier transformations, requiring computationally expensive linear system solutions.
  • Existing methodologies for handling such data are often inadequate.

Purpose of the Study:

  • To develop an efficient and fast Fourier base fitting method for masked or incomplete structured data.
  • To enable processing of multi-dimensional data, including smoothing and extrapolation with missing values.
  • To address the limitations of current methods in handling data gaps.

Main Methods:

  • Proposed an efficient Fourier base fitting algorithm for incomplete data.
  • Applied the method to multi-dimensional data (1D, 2D, 3D) for smoothing and extrapolation.
  • Investigated performance improvements through analytical and numerical optimizations.

Main Results:

  • The method successfully reconstructed noisy and partially unreliable brain pulsation data.
  • Peak reconstruction errors in masked regions were below 10% of the data range.
  • Computational optimizations achieved a 75-fold speed-up in 3D cases, reducing matrix assembly time significantly.

Conclusions:

  • The developed Fourier base fitting method is effective for masked and incomplete data.
  • Significant computational speed-ups were achieved through targeted optimizations.
  • The method shows promise for applications like non-invasive monitoring and neurological disease diagnostics.