Apply the Multiple-Sets Split Feasibility Problem to CT Image Reconstruction

WANG Pei-yuan; ZHOU Hai-yun

doi:10.3879/j.issn.1000-0887.2013.05.009

Volume 34 Issue 5

Turn off MathJax

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 2013 > 34(5): 506-517

WANG Pei-yuan, ZHOU Hai-yun. Apply the Multiple-Sets Split Feasibility Problem to CT Image Reconstruction[J]. Applied Mathematics and Mechanics, 2013, 34(5): 506-517. doi: 10.3879/j.issn.1000-0887.2013.05.009

Citation:

PDF( 1973 KB)

Apply the Multiple-Sets Split Feasibility Problem to CT Image Reconstruction

doi: 10.3879/j.issn.1000-0887.2013.05.009

Department of Mathematics, Ordnance Engineering College, Shijiazhuang 050003, P.R.China

Received Date: 2012-11-16
Rev Recd Date: 2013-04-12
Publish Date: 2013-05-15

Abstract

Abstract

To apply the CQ algorithm on the sparse angular CT image reconstruction better, a new realtime block successive mixed algorithm was proposed. Firstly, the problem of image reconstruction was transformed into the split feasibility problem. Secondly, through analyzing the different defines of nonempty closed convex sets C and Q,7 different implement cases in N dimension real space were proposed. Through simulations the convergence rate and reconstruction precision to different cases were analyzed, and how to select the constraint weights in algorithm and the output was studied. Then it obtain the best cases of CQ algorithm’s applying on sparse angular CT image reconstruction. Therefore, the best case of proposed algorithm is obtained. The results show that the proposed algorithm have faster convergence rate and better reconstruction precision. It proposes new ideas for applying the split feasibility problem and its extending norms to the CT incomplete projection data image reconstruction.
- CQ algorithm,
- multiple-sets split feasibility problem,
- nonempty convex set,
- image reconstruction

FullText(HTML)

References(12)

References

[1]	Bauschke H H, Borwein J M. On projection algorithms for solving convex feasibility problems[J].SIAM Rev,1996,38(3): 367-426.
[2]	Byrne C L. A unified treatment of some iterative algorithms in signal processing and image reconstruction[J].Inverse Problems,2004 ,20(1): 103-120.
[3]	Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space[J].J Numer Math,1994, 8(2): 221-239.
[4]	Byrne C L. Iterative projection onto convex sets using multiple Bregman distances[J]. Inverse Probl,1999, 15(5): 1295-1313.
[5]	Byrne C L. BregmanLegendre multidistance projection algorithms for convex feasibility and optimization[C]//Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications,Amsterdam, The Netherlands: Elsevier Science Publishers, 2001: 87-99.
[6]	Byrne C L. Iterative oblique projection onto convex sets and the split feasibility problem [J].Inverse Problems,2002, 18(2): 441-453.
[7]	Fukushima M. A relaxed projection method for variational inequalities[J].Math Program,1986 ,35(1): 58-70.
[8]	Yang Q. The relaxed CQ algorithm solving the split feasibility problem[J]. Inverse Problems,2004, 20(4): 1261-1266.
[9]	Censor Y, Elfving T, Kopf N, Bortfeld T. The multiplesets split feasibility problem and its applications for inverse problems[J]. Inverse Problems,2005, 21(6): 2071-2084.
[10]	Censor Y, Bortfeld T, Martin B, Trofimov A. A unified approach for inversion problems in intensitymodulated radiation therapy[J].Phys Med Biol,2006, 51(10): 2353-2365.
[11]	López G, MartínMrquez V, WANG Fenghui, XU Hongkun. Solving the split feasibility problem without prior knowledge of matrix norms[J].Inverse Problems,2012, 28(8): 1-18.
[12]	Zeng G S.Medical Image Reconstruction: A Conceptual Tutorial [M]. Beijing: Higher Education Press; Berlin Heidelberg: SpringerVerlag, 2010.