有效的傅里叶基拟合对屏蔽或不完整的结构化数据。

Frontiers in neuroimaging Pub Date : 2025-06-04 eCollection Date: 2025-01-01 DOI:10.3389/fnimg.2025.1480807
Fariba Karimi, Esra Neufeld, Arya Fallahi, Vartan Kurtcuoglu, Niels Kuster
{"title":"有效的傅里叶基拟合对屏蔽或不完整的结构化数据。","authors":"Fariba Karimi, Esra Neufeld, Arya Fallahi, Vartan Kurtcuoglu, Niels Kuster","doi":"10.3389/fnimg.2025.1480807","DOIUrl":null,"url":null,"abstract":"<p><strong>Introduction: </strong>Fourier 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.</p><p><strong>Methods: </strong>In 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.</p><p><strong>Results: </strong>The 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.</p><p><strong>Discussion: </strong>The 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.</p>","PeriodicalId":73094,"journal":{"name":"Frontiers in neuroimaging","volume":"4 ","pages":"1480807"},"PeriodicalIF":0.0000,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12175671/pdf/","citationCount":"0","resultStr":"{\"title\":\"Efficient Fourier base fitting on masked or incomplete structured data.\",\"authors\":\"Fariba Karimi, Esra Neufeld, Arya Fallahi, Vartan Kurtcuoglu, Niels Kuster\",\"doi\":\"10.3389/fnimg.2025.1480807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Introduction: </strong>Fourier 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.</p><p><strong>Methods: </strong>In 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.</p><p><strong>Results: </strong>The 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.</p><p><strong>Discussion: </strong>The 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.</p>\",\"PeriodicalId\":73094,\"journal\":{\"name\":\"Frontiers in neuroimaging\",\"volume\":\"4 \",\"pages\":\"1480807\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12175671/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers in neuroimaging\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3389/fnimg.2025.1480807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in neuroimaging","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3389/fnimg.2025.1480807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

简介:傅里叶基拟合对蒙面或不完整结构化数据具有重要意义,例如在生物医学图像数据处理中。然而,数据的不完全性破坏了傅里叶变换的简单的统一形式,使得构建和求解线性系统成为必要——这是一项条件不佳且计算代价昂贵的任务。尽管它很重要,但解决这一挑战的合适方法并不容易获得。方法:本研究提出一种高效、快速的傅立叶基拟合方法,适用于处理屏蔽或不完整的结构化数据。该方法可用于处理多维数据,包括平滑和内/外推,即使面临缺失数据。结果:建立的方法通过1D、2D和3D基准进行验证。在无创颅脊髓顺应性监测和神经系统疾病诊断的生物标志物开发的背景下,它的应用被证明是在重建嘈杂和部分不可靠的脑脉动数据。讨论:该研究调查了不同的分析和数值性能改进措施(例如,项重排,循环函数的预计算,向量化)对计算复杂性和速度的影响。对这些基准的定量评估表明,屏蔽区域的峰值重建误差仍然是可以接受的(即,低于所有调查基准数据范围的10%),而提出的计算优化将3D情况下的矩阵组装时间从843秒减少到11秒,与未优化的实现相比,速度提高了75倍。在需要时,可以选择使用奇异值分解(SVD)作为求解步骤的一部分来提供正则化。然而,随着考虑的傅里叶模式数量的增加,SVD在计算复杂性和资源成本方面迅速成为性能限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Fourier base fitting on masked or incomplete structured data.

Introduction: Fourier 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.

Methods: In 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.

Results: The 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.

Discussion: The 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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信