PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 8, 20260 citationsOpen Access

Efficient Fourier base fitting on masked or incomplete structured data

View Full Paper
FKFariba KarimiENE. NeufeldAFArya Fallahi

Key Points

  • The aim is to develop a faster and more efficient Fourier base fitting method for handling incomplete structured data.
  • Proposed a novel Fourier base fitting method for masked data.
  • Conducted benchmarks in 1D, 2D, and 3D scenarios.
  • Evaluated performance improvements through various optimization techniques.
  • Reconstruction errors in masked regions stayed below 10% of data range.
  • Matrix assembly time reduced from 843 seconds to 11 seconds, showing a 75-fold speed-up.
  • Singular value decomposition used for regularization but limited performance with increasing Fourier modes.

Abstract

IntroductionFourier base fitting for masked or incomplete structured data holds significant importance, for example in biomedical image data processing. However, data incompleteness destroys the simple unitary form of the Fourier transformation, necessitating the construction and solving of a linear system—a task that can suffer from poor conditioning and be computationally expensive. Despite its importance, suitable methodology addressing this challenge is not readily available.MethodsIn this study, we propose an efficient and fast Fourier base fitting method suitable for handling masked or incomplete structured data. The developed method can be used for processing multi-dimensional data, including smoothing and intra-/extrapolation, even when confronted with missing data.ResultsThe developed method was verified using 1D, 2D, and 3D benchmarks. Its application is demonstrated in the reconstruction of noisy and partially unreliable brain pulsation data in the context of the development of a biomarker for non-invasive craniospinal compliance monitoring and neurological disease diagnostics.DiscussionThe study investigated the impact of different analytical and numerical performance improvement measures (e.g., term rearrangement, precomputation of recurring functions, vectorization) on computational complexity and speed. Quantitative evaluations on these benchmarks demonstrated that peak reconstruction errors in masked regions remained acceptable (i.e., below 10 % of the data range for all investigated benchmarks), while the proposed computational optimizations reduced matrix assembly time from 843 s to 11 s in 3D cases, demonstrating a 75-fold speed-up compared to unoptimized implementations. Singular value decomposition (SVD) can optionally be employed as part of the solving-step to provide regularization when needed. However, SVD quickly becomes the performance limiting in terms of computational complexity and resource cost, as the number of considered Fourier modes increases.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Karimi et al. (2025) studied this question.

synapsesocial.com/papers/6988291e0fc35cd7a884922ahttps://doi.org/10.5167/uzh-290966
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Fast Multidimensional Partial Fourier Transform with Automatic Hyperparameter Selection2024 · 7 citations
  2. 2Sparse Transform and Compressed Sensing Methods to Improve Efficiency and Quality in Magnetic Resonance Medical Imaging2025
  3. 3Reducing the Sampling Burden of Fourier Sensing with a Non-rectangular Field-of-View2024
  4. 4Fully Spectral Partial Shape Matching2017 · 106 citations
  5. 5Censored Least Squares for Imputing Missing Values in PARAFAC Tensor Factorization2024