首页> 外文会议>IEEE Nuclear Science Symposium >Fast transmission CT reconstruction for SPECT using a block-iterative algorithm
【24h】

Fast transmission CT reconstruction for SPECT using a block-iterative algorithm

机译:SPECT使用块迭代算法的快速传输CT重建

获取原文
获取外文期刊封面目录资料

摘要

We present an iterative transmission reconstruction algorithm based on principles used for block-iterative emission reconstruction. Filtered backprojection (FBP) is adequate for transmission CT image reconstruction under ideal conditions. In cases where insufficient count rates are obtained, FBP suffers from significant biases. Our block-iterative transmission algorithm is developed by analogy to ordered-subset emission CT algorithms. We show similarities between our algorithm and a previously-proposed Ordered-Subset Convex (OSC) algorithm. Under ideal conditions, our block-iterative transmission algorithm generates estimates of attenuation line integrals that are not significantly different from those from FBP or OSC. In the case of very low count-rate data, our block-iterative algorithm produces line integral estimates that are less biased than those from FBP and nearly identical to those from OSC. We show that our algorithm is more computationally efficient than OSC, but that OSC performs slightly better with different subset configurations. We conclude that both BIT and OSC are viable alternatives to FBP, especially under poor imaging conditions.
机译:我们介绍了一种基于用于街区迭代排放重建的原理的迭代传输重建算法。过滤的反冲(FBP)足以在理想条件下传输CT图像重建。在获得计数不足的情况下,FBP遭受显着的偏见。我们的街区迭代传输算法是通过类比开发的订购子集发射CT算法而开发的。我们在算法和先前提出的订购子集凸(OSC)算法之间显示相似之处。在理想条件下,我们的块迭代传输算法生成了与FBP或OSC的衰减线积分的估计值。在非常低的计数数据的情况下,我们的块迭代算法产生的线积分估计比来自FBP的线积分估计值较小,并且与来自OSC的相同几乎相同。我们表明我们的算法比OSC更加计算效率,但OSC以不同的子集配置略微更好地执行。我们得出结论,两位和OSC都是FBP的可行替代品,尤其是在差的成像条件下。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号