首页> 外文会议>IEEE International Symposium on Biomedical Imaging >O(N/sup 2/ log N) native fan-beam tomographic reconstruction
【24h】

O(N/sup 2/ log N) native fan-beam tomographic reconstruction

机译:O(n / sup 2 / log n)本机粉丝波束断层切断重建

获取原文

摘要

We present a new fast backprojection algorithm for CT fan-beam reconstruction. The new algorithm operates directly on fan-beam data without prior rebinning to parallel-beam projections. The algorithm reduces the computational complexity from O(N/sup 3/) for the traditional fan-beam algorithm to O(N/sup 2/ log N). Simulations demonstrate speedups of greater than 50-fold for a 512 /spl times/ 512 image, with no perceivable degradation in accuracy. The algorithm also applies to multi-slice helical 3D reconstruction, and extends to 3D cone-beam reconstruction.
机译:我们为CT扇波重建提供了一种新的快速反应算法。新算法直接在扇形波束数据上运行,无需先前重新融合到平行束投影。该算法将传统风扇射线算法O(n / sup 3 /)降低到O(n / sup 2 / log n)的计算复杂度。仿真显示512 / SPL时间/ 512图像的大于50倍的加速,无可受能的降解精度。该算法也适用于多切片螺旋3D重建,并延伸到3D锥形光束重建。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号