首页> 外文会议>IEEE Nuclear Science Symposium and Medical Imaging Conference >General expression based loop unrolling scheme for real-time implementation of PAI
【24h】

General expression based loop unrolling scheme for real-time implementation of PAI

机译:基于循环展开的循环展开,实时实现PAI

获取原文

摘要

Despite the total variation gradient descent (TV-GD) algorithm has revealed a good performance for photoacoustic imaging (PAI), fast or real-time imaging remains a challenge. In this paper, a dependence graph was introduced to help to exploit the data dependencies that exist in the TV-GD algorithm, and a general expression was then for the first time derived to unroll the inner loop that occupied the majority of the entire running time of the algorithm. Thus all the terms consisting of the system matrices or the projections were extracted and preprocessed rather than being calculated along with reconstruction, and the reconstruction time was then expected to be linear to the iteration steps decided by the outer loop. For implementation, we adopted a low cost preprocessing method to avoid directly calculating the compute-intensive matrix chain products carried by the general expression itself. For simplicity, we accessed the CUBLAS library to parallelize the execution of the matrix-vector multiplication and the vector addition generated by the general expression. The under-sampled data with 30, 60, 90 and 120 projections were adopted to reconstruct a 128×128 Shepp-Logan Phantom. As expected, the simulation results revealed that the reconstruction time of the proposed scheme almost increased linearly with the iteration steps. Similarly, once the iteration steps was determined, the reconstruction time appeared independent of the sampling points and almost kept still. In addition, the mean squared errors (MSEs) of reconstruction were kept lower than 10 in each case with the iteration steps set as 30, and a maximum speedup of 179X was then achieved from the 120-view data with 30 iterations.
机译:尽管总变化梯度下降(TV-GD)算法揭示了光声成像(PAI)的良好性能,快速或实时成像仍然是一个挑战。在本文中,引入了一种依赖性图,帮助利用了TV-GD算法中存在的数据依赖性,并且第一次导出的常规表达式展开,以展开占据整个运行时间的大多数的内循环算法。因此,提取和预处理的所有术语组成,并预处理而不是与重建一起计算,然后预期重建时间是线性的,到由外环决定的迭代步骤。为了实施,我们采用了一种低成本的预处理方法,以避免直接计算一般表达本身携带的计算密集型矩阵链产品。为简单起见,我们访问了CUBLAS库以并行化矩阵矢量乘法的执行和由一般表达式生成的矢量添加。采用具有30,60,90和120和120个投影的欠采样数据来重建128×128 Shepp-Logan Phantom。如预期的那样,仿真结果表明,建议方案的重建时间几乎随着迭代步骤线性增加。类似地,一旦确定了迭代步骤,重建时间就会独立于采样点并且几乎保持静止。另外,在每种情况下,在每种情况下,将重建的平均平方误差(MSES)保持在设置为30的迭代步骤,然后从具有30次迭代的120视图数据实现179x的最大加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号