摘要
深入研究了代数重建算法求解中的迭代过程,从迭代次序入手,根据预先估计所得的每个超平面的伪误差大小来确定迭代投影次序,从而改变了传统代数重建算法迭代求解过程中所遵循的固定投影次序,且新的投影次序具有自适应的优点。实验结果表明,本方法求解的收敛速度及解的精度都有明显的改善。
Keeping an eye on the projection sequence in traditional algebraic reconstruction algorithm,the proposed algorithm does projection in an order which is decided by the value of pseudo error of each hyperplane computed in prior.So the given order in traditional algorithm turns to be an adaptive one.Experimental results indicate that the modified algorithm gives much better results than the classical one.
出处
《吉林大学学报（工学版）》
EI
CAS
CSCD
北大核心
2009年第S2期364-366,共3页
Journal of Jilin University:Engineering and Technology Edition
基金
国家自然科学基金项目(60672100)
关键词
信息处理技术
代数重建算法
图像重建
递推算法
反问题
information processing technology
algebraic reconstruction algorithm
image reconstructioniterative
algorithm
inverse problem
