...
首页> 外文期刊>Physics in medicine and biology. >Improved total variation-based CT image reconstruction applied to clinical data.
【24h】

Improved total variation-based CT image reconstruction applied to clinical data.

机译:改进的基于总变异的CT图像重建应用于临床数据。

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

摘要

In computed tomography there are different situations where reconstruction has to be performed with limited raw data. In the past few years it has been shown that algorithms which are based on compressed sensing theory are able to handle incomplete datasets quite well. As a cost function these algorithms use the l(1)-norm of the image after it has been transformed by a sparsifying transformation. This yields to an inequality-constrained convex optimization problem. Due to the large size of the optimization problem some heuristic optimization algorithms have been proposed in the past few years. The most popular way is optimizing the raw data and sparsity cost functions separately in an alternating manner. In this paper we will follow this strategy and present a new method to adapt these optimization steps. Compared to existing methods which perform similarly, the proposed method needs no a priori knowledge about the raw data consistency. It is ensured that the algorithm converges to the lowest possible value of the raw data cost function, while holding the sparsity constraint at a low value. This is achieved by transferring the step-size determination of both optimization procedures into the raw data domain, where they are adapted to each other. To evaluate the algorithm, we process measured clinical datasets. To cover a wide field of possible applications, we focus on the problems of angular undersampling, data lost due to metal implants, limited view angle tomography and interior tomography. In all cases the presented method reaches convergence within less than 25 iteration steps, while using a constant set of algorithm control parameters. The image artifacts caused by incomplete raw data are mostly removed without introducing new effects like staircasing. All scenarios are compared to an existing implementation of the ASD-POCS algorithm, which realizes the step-size adaption in a different way. Additional prior information as proposed by the PICCS algorithm can be incorporated easily into the optimization process.
机译:在计算机断层扫描中,存在必须用有限的原始数据进行重建的不同情况。在过去的几年中,已经表明基于压缩感测理论的算法能够很好地处理不完整的数据集。作为代价函数,这些算法使用经过稀疏变换的图像的l(1)-范数。这就产生了一个不等式约束的凸优化问题。由于优化问题的规模很大,因此在过去几年中已经提出了一些启发式优化算法。最流行的方式是以交替方式分别优化原始数据和稀疏性成本函数。在本文中,我们将遵循这种策略,并提出一种适应这些优化步骤的新方法。与性能类似的现有方法相比,该方法不需要有关原始数据一致性的先验知识。确保算法收敛到原始数据成本函数的最低可能值,同时将稀疏性约束保持在较低的值。这是通过将两个优化过程的步长确定转移到原始数据域中来实现的,在原始数据域中它们相互适应。为了评估算法,我们处理了测量的临床数据集。为了涵盖可能的应用的广泛领域,我们关注于角度欠采样,由于金属注入而导致的数据丢失,有限的视角层析成像和内部层析成像等问题。在所有情况下,在使用恒定的算法控制参数集的情况下,所提出的方法都可以在不到25个迭代步骤内达到收敛。由不完整的原始数据导致的图像伪影大部分都可以消除,而不会引入新的效果,例如楼梯。将所有方案与ASD-POCS算法的现有实现进行了比较,该实现以不同的方式实现了步长自适应。 PICCS算法提出的其他先验信息可以轻松地纳入优化过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号