X射线CT迭代图像重建的一阶凸可行性算法
First-order convex feasibility algorithms for iterative image reconstruction in X-ray CT
摘要:
计算机断层成像(CT)中的迭代图像重建(IIR)算法基于用于求解特定优化问题的算法。因此,IIR算法的设计是由其所基于的优化问题的解的知识来辅助的。然而,通常情况下,实现对感兴趣的优化的精确解是不切实际的,这使得IIR算法的设计复杂化。这个问题对于具有有限角度范围扫描的CT来说尤其严重,这导致条件差的系统矩阵并且难以解决优化问题。在这篇文章中,我们开发了IIR算法,解决了某种类型的优化称为凸可行性。凸可行性方法可以为无约束优化方法提供替代方案,同时允许有效的算法来解决问题-从而促进IIR算法的设计过程。加速版本的Chambolle-Pock(CP)算法适用于各种凸可行性问题的潜在兴趣IIR在CT。建议的问题之一被认为是相当于最小二乘最小化,和其他两个问题提供了替代惩罚,最小二乘最小化。
英文摘要:
Iterative image reconstruction (IIR) algorithms in Computed Tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times, however, it is impractical to achieve accurate solution to the optimization of interest, which complicates design of IIR algorithms. This issue is particularly acute for CT with a limited angular-range scan, which leads to poorly conditioned system matrices and difficult to solve optimization problems. In this article, we develop IIR algorithms which solve a certain type of optimization called convex feasibility. The convex feasibility approach can provide alternatives to unconstrained optimization approaches and at the same time allow for efficient algorithms for their solution -- thereby facilitating the IIR algorithm design process. An accelerated version of the Chambolle-Pock (CP) algorithm is adapted to various convex feasibility problems of potential interest to IIR in CT. One of the proposed problems is seen to be equivalent to least-squares minimization, and two other problems provide alternatives to penalized, least-squares minimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。