相关实验视频
Updated: Jun 25, 2025

08:51
Magnetic Resonance Imaging of Multiple Sclerosis at 7.0 Tesla
Published on: February 19, 2021
8.9K
基于双域更快的富里埃卷积网络用于MR图像重建
Xiaohan Liu1, Yanwei Pang2, Yiming Liu2
1TJK-BIIT Lab, School of Electrical and Information Engineering, Tianjin University, Tianjin, 300072, China; Tiandatz Technology Co. Ltd., Tianjin, 300072, China.
Computers in biology and medicine
|May 23, 2024
概括
这项研究引入了一种新的深度学习框架,用于更快的磁共振成像 (MRI) 重建. 新的双域更快的富里埃卷积网络 (D2F2) 从低样本数据显著提高了图像质量.
科学领域:
- 医疗成像医学成像
- 人工智能的人工智能
- 信号处理 信号处理
背景情况:
- 深度学习通过从低采样k空间数据重建图像来加速磁共振成像 (MRI).
- 现有的方法面临受感场大小,数据一致性刚性和精细化结构的局限性,阻碍了性能.
研究的目的:
- 开发一个先进的深度学习框架,以提高MRI重建的质量和速度.
- 解决当前双域重建网络的局限性.
主要方法:
- 引入了更快的逆里埃卷积 (FasterIFC),以扩展k空间域网中的受容场.
- 为灵活的数据一致性策略开发了一种新的软数据一致性 (SofterDC) 层.
- 提出了基于双域更快的富里埃卷积网络 (D2F2),并行结构利用FasterIFC和SofterDC.
主要成果:
- 在NYU快速MRI数据集上,D2F2在多个加速度因子上表现出卓越的性能.
- 该框架在数量和质量MRI重建评估方面取得了显著的改进.
- 更快的IFC有效地利用了k空间数据中的远程信息.
结论:
- 拟议的D2F2框架显著提高了MRI重建的质量和效率.
- 更快的IFC操作员和更软的DC层是克服基于深度学习的MRI局限性的关键创新.
- 这种方法代表了快速MRI技术的重大进步.
相关概念视频
Magnetic Resonance Imaging
5.1K
Magnetic resonance imaging (MRI) is a noninvasive medical imaging technique based on a phenomenon of nuclear physics discovered in the 1930s, in which matter exposed to magnetic fields and radio waves was found to emit radio signals. In 1970, a physician and researcher named Raymond Damadian noticed that malignant (cancerous) tissue gave off different signals than normal body tissue. He applied for a patent for the first MRI scanning device in clinical use by the early 1980s. The early MRI...
5.1K
Fast Fourier Transform
309
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
309

