fRAKI:具有离线数据通用和在线扫描特定先验的k空间深度学习

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jing Pan , Xiaohan Liu , Yiming Liu , Xuebin Sun , Yanwei Pang
{"title":"fRAKI:具有离线数据通用和在线扫描特定先验的k空间深度学习","authors":"Jing Pan ,&nbsp;Xiaohan Liu ,&nbsp;Yiming Liu ,&nbsp;Xuebin Sun ,&nbsp;Yanwei Pang","doi":"10.1016/j.neucom.2025.130663","DOIUrl":null,"url":null,"abstract":"<div><div>Sampling a limited number of phase-encoding lines followed by estimating missing lines is an efficient method for shortening scan time of MRI. GeneRalized Autocalibarating Partial Parallel Acquisition (GRAPPA) is such a classical method and is widely used in clinical MRI. As a non-linear method, Robust Artificial-neural-networks for K-space Interpolation (RAKI) is a break-through of GRAPPA in the sense of much higher estimation accuracy. However, RAKI takes much longer estimation time because it requires online training a network for each receiving coil. To overcome the low-efficiency problem, we propose a fast version of RAKI (called fRAKI). fRAKI is roughly 26 times faster and can obtain much higher estimation accuracy compared with RAKI. The high efficiency of fRAKI is due to two properties: (1) A single network is shared to estimate missing lines of all the coils. (2) The online training of fRAKI can converge after a smaller number of iterations. Fast convergency is obtained by using a pre-trained model for initializing learnable parameters. High accuracy benefits from that the pre-train model contains data-universal prior and is also used as a sub-network of fRAKI so that the online training subnetwork can focus on learning scan-specific prior without the risk of overfitting the scan-specific data. Experimental results on the NYU fastMRI knee and brain datasets demonstrate the efficiency and accuracy of the proposed fRAKI.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"648 ","pages":"Article 130663"},"PeriodicalIF":5.5000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"fRAKI: k-space deep learning with offline data-universal and online scan-specific priors\",\"authors\":\"Jing Pan ,&nbsp;Xiaohan Liu ,&nbsp;Yiming Liu ,&nbsp;Xuebin Sun ,&nbsp;Yanwei Pang\",\"doi\":\"10.1016/j.neucom.2025.130663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Sampling a limited number of phase-encoding lines followed by estimating missing lines is an efficient method for shortening scan time of MRI. GeneRalized Autocalibarating Partial Parallel Acquisition (GRAPPA) is such a classical method and is widely used in clinical MRI. As a non-linear method, Robust Artificial-neural-networks for K-space Interpolation (RAKI) is a break-through of GRAPPA in the sense of much higher estimation accuracy. However, RAKI takes much longer estimation time because it requires online training a network for each receiving coil. To overcome the low-efficiency problem, we propose a fast version of RAKI (called fRAKI). fRAKI is roughly 26 times faster and can obtain much higher estimation accuracy compared with RAKI. The high efficiency of fRAKI is due to two properties: (1) A single network is shared to estimate missing lines of all the coils. (2) The online training of fRAKI can converge after a smaller number of iterations. Fast convergency is obtained by using a pre-trained model for initializing learnable parameters. High accuracy benefits from that the pre-train model contains data-universal prior and is also used as a sub-network of fRAKI so that the online training subnetwork can focus on learning scan-specific prior without the risk of overfitting the scan-specific data. Experimental results on the NYU fastMRI knee and brain datasets demonstrate the efficiency and accuracy of the proposed fRAKI.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"648 \",\"pages\":\"Article 130663\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231225013359\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225013359","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

对有限数量的相位编码线进行采样,然后估计缺失线是缩短MRI扫描时间的有效方法。广义自校准部分平行采集(GRAPPA)就是这样一种经典的方法,在临床MRI中得到了广泛的应用。鲁棒人工神经网络(Robust Artificial-neural-networks for K-space Interpolation, RAKI)作为一种非线性插值方法,在估计精度上大大提高,是GRAPPA的突破。然而,RAKI需要更长的估计时间,因为它需要在线训练每个接收线圈的网络。为了克服低效率问题,我们提出了一种快速版本的RAKI(称为fRAKI)。与RAKI相比,fRAKI速度大约快26倍,并且可以获得更高的估计精度。fRAKI的高效率是由于两个特性:(1)共享一个网络来估计所有线圈的缺失线。(2) fRAKI的在线训练可以在较少的迭代次数后收敛。采用预训练模型初始化可学习参数,实现了快速收敛。高准确率得益于预训练模型包含数据通用先验,并且作为fRAKI的子网络,使得在线训练子网络可以专注于学习扫描特定先验,而不会有扫描特定数据过拟合的风险。在NYU fastMRI膝关节和脑部数据集上的实验结果证明了所提出的fRAKI的有效性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
fRAKI: k-space deep learning with offline data-universal and online scan-specific priors
Sampling a limited number of phase-encoding lines followed by estimating missing lines is an efficient method for shortening scan time of MRI. GeneRalized Autocalibarating Partial Parallel Acquisition (GRAPPA) is such a classical method and is widely used in clinical MRI. As a non-linear method, Robust Artificial-neural-networks for K-space Interpolation (RAKI) is a break-through of GRAPPA in the sense of much higher estimation accuracy. However, RAKI takes much longer estimation time because it requires online training a network for each receiving coil. To overcome the low-efficiency problem, we propose a fast version of RAKI (called fRAKI). fRAKI is roughly 26 times faster and can obtain much higher estimation accuracy compared with RAKI. The high efficiency of fRAKI is due to two properties: (1) A single network is shared to estimate missing lines of all the coils. (2) The online training of fRAKI can converge after a smaller number of iterations. Fast convergency is obtained by using a pre-trained model for initializing learnable parameters. High accuracy benefits from that the pre-train model contains data-universal prior and is also used as a sub-network of fRAKI so that the online training subnetwork can focus on learning scan-specific prior without the risk of overfitting the scan-specific data. Experimental results on the NYU fastMRI knee and brain datasets demonstrate the efficiency and accuracy of the proposed fRAKI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
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学术官方微信