Advanced Concept Development, Invivo Corporation, Gainesville, Florida 32608, USA.
Magn Reson Med. 2009 Nov;62(5):1261-9. doi: 10.1002/mrm.22128.
A partial Fourier acquisition scheme has been widely adopted for fast imaging. There are two problems associated with the existing techniques. First, the majority of the existing techniques demodulate the phase information and cannot provide improved phase information over zero-padding. Second, serious artifacts can be observed in reconstruction when the phase changes rapidly because the low-resolution phase estimate in the image space is prone to error. To tackle these two problems, a novel and robust method is introduced for partial Fourier reconstruction, using k-space convolution. In this method, the phase information is implicitly estimated in k-space through data fitting; the approximated phase information is applied to recover the unacquired k-space data through Hermitian operation and convolution in k-space. In both spin echo and gradient echo imaging experiments, the proposed method consistently produced images with the lowest error level when compared to Cuppen's algorithm, projection onto convex sets-based iterative algorithm, and Homodyne algorithm. Significant improvements are observed in images with rapid phase change. Besides the improvement on magnitude, the phase map of the images reconstructed by the proposed method also has significantly lower error level than conventional methods.
一种部分傅里叶采集方案已被广泛应用于快速成像。现有的技术存在两个问题。首先,大多数现有的技术解调相位信息,但不能提供优于零填充的改进相位信息。其次,由于图像空间中的低分辨率相位估计容易出错,当相位变化迅速时,在重建中会观察到严重的伪影。为了解决这两个问题,引入了一种新的、稳健的基于 k 空间卷积的部分傅里叶重建方法。在该方法中,通过数据拟合在 k 空间中隐式估计相位信息;通过 Hermitian 运算和 k 空间卷积,将近似的相位信息应用于恢复未采集的 k 空间数据。在自旋回波和梯度回波成像实验中,与 Cuppen 算法、基于凸集投影的迭代算法和同相算法相比,所提出的方法始终产生具有最低误差水平的图像。在相位变化迅速的图像中观察到显著的改善。除了幅度的提高外,所提出的方法重建的相位图的误差水平也明显低于传统方法。