摘要
我们基于 Landweber 的方法为角度有限图象重建介绍一个一般反复的计划。我们为这个计划导出一个表示公式并且因而建立它的集中条件。我们的结果在与其他的设计方法作比较的 L <SUP>2</SUP>-norm 为角度有限图象重建为加速的集中建议某些松驰策略。convolution-backprojection 算法为这个反复的过程被给。
We introduce a general iterative scheme for angle-limited image reconstruction based on Landwebet＇s method. We derive a representation formula for this scheme and consequently establish its convergence conditions. Our results suggest certain relaxation strategies for an accelerated convergence for angle-limited image reconstruction in L^2-norm comparing with alternative projection methods. The convolution-backprojection algorithm is given for this iterative process.
基金
Supported by the National Natural Science Foundation of China(No.60772041,60325101,60272018,60628102)
the National Key Basic Research Special Foundation(2003CB716101),Ministry of Education(306017)
Engineering Research Institute of Peking University,and Microsoft Research Asia.
关键词
Landweber迭代法
图像重建
卷积反投影算法
收敛条件
加速收敛
替代性
The Landweber iteration
angle-limited image reconstruction
the selections of relaxation coefficients
convolution-backprojection algorithm
