期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Randomized Kaczmarz algorithm for CT reconstruction 被引量:1
1
作者 赵可 潘晋孝 孔慧华 《Journal of Measurement Science and Instrumentation》 CAS 2013年第1期34-37,共4页
The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proof... The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proofs are given.Thomas Strohmer and Roman Vershynin introduced a randomized version of the Kaczmarz method for consistent,and over-determined linear systems and proved whose rate does not depend on the number of equations in the systems in 2009.In this paper,we apply this method to computed tomography(CT)image reconstruction and compared images generated by the sequential Kaczmarz method and the randomized Kaczmarz method.Experiments demonstrates the feasibility of the randomized Kaczmarz algorithm in CT image reconstruction and its exponential curve convergence. 展开更多
关键词 Kaczmarz method iterative algorithm randomized Kaczmarz method computed tomography(ct) ct image reconstruction exponent curve fitting
下载PDF
A Splitting Primal-dual Proximity Algorithm for Solving Composite Optimization Problems 被引量:3
2
作者 Yu Chao TANG Chuan Xi ZHU +1 位作者 Meng WEN Ji Gen PENG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2017年第6期868-886,共19页
Our work considers the optimization of the sum of a non-smooth convex function and a finite family of composite convex functions, each one of which is composed of a convex function and a bounded linear operator. This ... Our work considers the optimization of the sum of a non-smooth convex function and a finite family of composite convex functions, each one of which is composed of a convex function and a bounded linear operator. This type of problem is associated with many interesting challenges encoun- tered in the image restoration and image reconstruction fields. We developed a splitting primal-dual proximity algorithm to solve this problem. Furthermore, we propose a preconditioned method~ of which the iterative parameters are obtained without the need to know some particular operator norm in advance. Theoretical convergence theorems are presented. We then apply the proposed methods to solve a total variation regularization model, in which the L2 data error function is added to the L1 data error function. The main advantageous feature of this model is its capability to combine different loss functions. The numerical results obtained for computed tomography (CT) image recon- struction demonstrated the ability of the proposed algorithm to reconstruct an image with few and sparse projection views while maintaining the image quality. 展开更多
关键词 Sparse optimization proximity operator saddle-point problem ct image reconstruction
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部