...
首页> 外文期刊>Physics in medicine and biology. >A faster ordered-subset convex algorithm for iterative reconstruction in a rotation-free micro-CT system.
【24h】

A faster ordered-subset convex algorithm for iterative reconstruction in a rotation-free micro-CT system.

机译:在无旋转微型CT系统中迭代重建的一种更快的有序子集凸算法。

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

摘要

We present a faster iterative reconstruction algorithm based on the ordered-subset convex (OSC) algorithm for transmission CT. The OSC algorithm was modified such that it calculates the normalization term before the iterative process in order to save computational cost. The modified version requires only one backprojection per iteration as compared to two required for the original OSC. We applied the modified OSC (MOSC) algorithm to a rotation-free micro-CT system that we proposed previously, observed its performance, and compared with the OSC algorithm for 3D cone-beam reconstruction. Measurements on the reconstructed images as well as the point spread functions show that MOSC is quite similar to OSC; in noise-resolution trade-off, MOSC is comparable with OSC in a regular-noise situation and it is slightly worse than OSC in an extremely high-noise situation. The timing record shows that MOSC saves 25-30% CPU time, depending on the number of iterations used. We conclude that the MOSC algorithm is more efficient than OSC and provides comparable images.
机译:我们提出了一种基于有序子集凸(OSC)算法的更快的迭代重建算法,用于传输CT。修改了OSC算法,以便在迭代过程之前计算归一化项,以节省计算成本。修改后的版本每次迭代仅需要一个反投影,而原始OSC需要两个。我们将改进的OSC(MOSC)算法应用于我们先前提出的无旋转微型CT系统,观察了其性能,并与OSC算法进行了3D锥束重建的比较。对重建图像以及点扩散函数的测量表明,MOSC与OSC十分相似。在噪声分辨率的折衷中,MOSC在常规噪声情况下可与OSC媲美,而在极高噪声情况下则比OSC差。时序记录显示,根据所使用的迭代次数,MOSC可以节省25-30%的CPU时间。我们得出的结论是,MOSC算法比OSC更有效,并且可以提供可比的图像。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号