首页> 美国卫生研究院文献>Oncotarget >An efficient iterative CBCT reconstruction approach using gradient projection sparse reconstruction algorithm
【2h】

An efficient iterative CBCT reconstruction approach using gradient projection sparse reconstruction algorithm

机译:使用梯度投影稀疏重建算法的高效迭代CBCT重建方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The purpose of this study is to develop a fast and convergence proofed CBCT reconstruction framework based on the compressed sensing theory which not only lowers the imaging dose but also is computationally practicable in the busy clinic. We simplified the original mathematical formulation of gradient projection for sparse reconstruction (GPSR) to minimize the number of forward and backward projections for line search processes at each iteration. GPSR based algorithms generally showed improved image quality over the FDK algorithm especially when only a small number of projection data were available. When there were only 40 projections from 360 degree fan beam geometry, the quality of GPSR based algorithms surpassed FDK algorithm within 10 iterations in terms of the mean squared relative error. Our proposed GPSR algorithm converged as fast as the conventional GPSR with a reasonably low computational complexity. The outcomes demonstrate that the proposed GPSR algorithm is attractive for use in real time applications such as on-line IGRT.
机译:这项研究的目的是基于压缩感知理论开发一种快速且经过收敛证明的CBCT重建框架,该框架不仅可以降低成像剂量,而且在繁忙的诊所中在计算上是可行的。我们简化了稀疏重建(GPSR)的梯度投影的原始数学公式,以最大程度地减少每次迭代时线搜索过程的正向和反向投影的数量。基于GPSR的算法通常显示出比FDK算法更好的图像质量,尤其是在只有少量投影数据可用时。当360度扇形束几何图形只有40个投影时,基于均方根相对误差,基于GPSR的算法的质量在10次迭代中就超过了FDK算法。我们提出的GPSR算法以相当低的计算复杂度与传统GPSR一样快地收敛。结果表明,提出的GPSR算法对于实时应用(例如在线IGRT)具有吸引力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号