非线性空间编码的实际利用:快速场地图和FRONSAC波浪
Horace Z Zhang1, R Todd Constable1,2, Gigi Galiana1,2
1Department of Biomedical Engineering, Yale University, New Haven, Connecticut, USA.
Magnetic resonance in medicine
|April 23, 2024
概括
FRONSAC编码提高了波波成像质量,特别是在高低采样率下. 这种简化场地映射方法可以减少校准时间,同时保持图像质量.
科学领域:
- 磁共振成像 (MRI) 是一种磁共振成像技术.
- 图像重建 图像的重建
- 信号处理 信号处理
背景情况:
- 在MRI中波编码提供了加速的数据采集.
- FRONSAC (频域调节非亚样本绝对对比) 编码是一种改进图像重建的技术.
- 准确的场地测绘对于高质量的波形图像非常重要.
研究的目的:
- 评估FRONSAC编码在二维和三维波序中的附加值.
- 为FRONSAC编码梯度实施简化轨迹映射策略.
- 为了评估组合波和FRONSAC编码的性能.
主要方法:
- 使用点传播函数的频域稀疏度估计的非线性梯度轨迹.
- 为了分析编码性能,进行了模拟和体内实验.
- 简化现场绘图方法与综合方案的比较.
主要成果:
- 简化场地映射实现了可比的图像质量,并大大缩短了校准时间.
- FRONSAC编码改善了波形图像质量,特别是在高低采样因子和有限的波幅下.
- G-因子映射证实了观察到的图像质量的改善.
结论:
- FRONSAC编码有效地提高了在高低样本率或大量限制条件下波形象质量.
- 提出的快速现场映射方法显示了临床MRI应用的巨大潜力.
- 这项研究验证了FRONSAC对提高MRI采集效率和图像保真性的有用性.
相关概念视频
Super-resolution Fluorescence Microscopy
7.0K
Super-resolution fluorescence microscopy (SRFM) provides a better resolution than conventional fluorescence microscopy by reducing the point spread function (PSF). PSF is the light intensity distribution from a point that causes it to appear blurred. Due to PSF, each fluorescing point appears bigger than its actual size, and it is the PSF interference of nearby fluorophores that causes the blurred image. Various approaches to achieving higher resolution through SRFM have recently been...
7.0K
NMR Spectrometers: Radiofrequency Pulses and Pulse Sequences
798
A pulse is a short burst of radio waves distributed over a range of frequencies that simultaneously excites all the nuclei in the sample. Upon passing a radio frequency pulse along the x-axis, the nuclei absorb energy corresponding to their Larmor frequencies and achieve resonance. This shifts the net magnetization vector from the z-axis toward the transverse plane. This angle of rotation of the magnetization vector, or the flip angle, is proportional to the duration and intensity of the pulse.
798
Fast Fourier Transform
313
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...
313


