【24h】

MR Image Reconstruction Using the GPU

机译:使用GPU进行MR图像重建

获取原文
获取原文并翻译 | 示例

摘要

Magnetic resonance (MR) image reconstruction has reached a bottleneck where further speed improvement from the algorithmic perspective is difficult. However, some clinical practices such as real-time surgery monitoring demand faster reconstruction than what is currently available. For such dynamic imaging applications, radial sampling in k-space (i.e. projection acquisition) recently revives due to fast image acquisition, relatively good signal-to-noise ratio, and better resistance to motion artifacts, as compared with the conventional Cartesian scan. Concurrently, using the graphic processing unit (GPU) to improve algorithm performance has become increasingly popular. In this paper, an efficient GPU implementation of the fast Fourier transform (FFT) will first be described in detail, since the FFT is an important part of virtually all MR image reconstruction algorithms. Then, we evaluate the speed and image quality for the GPU implementation of two reconstruction algorithms that are suited for projection acquisition. The first algorithm is the look-up table based gridding algorithm. The second one is the filtered backprojection method which is widely used in computed tomography. Our results show that the GPU implementation is up to 100 times faster than a conventional CPU implementation with comparable image quality.
机译:磁共振(MR)图像重建已成为瓶颈,从算法的角度来看,进一步提高速度非常困难。但是,某些临床实践(例如实时手术监控)要求比当前可用的重建速度更快的重建。对于这样的动态成像应用,与常规的笛卡尔扫描相比,由于快速的图像获取,相对良好的信噪比以及对运动伪像的更好的抵抗性,最近在k空间中进行径向采样(即投影获取)。同时,使用图形处理单元(GPU)来提高算法性能变得越来越流行。在本文中,由于FFT实际上是所有MR图像重建算法的重要组成部分,因此将首先详细介绍快速傅里叶变换(FFT)的高效GPU实现。然后,我们评估适用于投影采集的两种重建算法的GPU实现的速度和图像质量。第一种算法是基于查找表的网格化算法。第二种是滤波反投影方法,该方法广泛用于计算机断层扫描中。我们的结果表明,GPU的实现速度比具有类似图像质量的传统CPU的实现快了100倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号