基于CT图像重建的多重集合分裂可行性问题应用分析

王培元; 周海云

doi:10.3879/j.issn.1000-0887.2013.05.009

基于CT图像重建的多重集合分裂可行性问题应用分析

doi: 10.3879/j.issn.1000-0887.2013.05.009

军械工程学院基础部数学教研室,石家庄 050003

基金项目: 国家自然科学基金资助项目（10632040）

详细信息

作者简介:
王培元(1985—),男,河北献县人,博士生(通讯作者. E-mail: wangpy629@163.com).

中图分类号: TP301.6
计量
- 文章访问数: 1583
- HTML全文浏览量: 130
- PDF下载量: 1487
- 被引次数: 0
出版历程
- 收稿日期: 2012-11-16
- 修回日期: 2013-04-12
- 刊出日期: 2013-05-15

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

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

摘要

摘要: 为了较好地应用CQ算法解决稀疏角度CT 图像重建的问题，提出了一种新的实时的分块逐次混合算法．首先将稀疏角度CT 图像重建的重建问题转化成分裂可行性问题．其次，通过分析非空闭凸集C和Q的不同的定义，在N维实空间中分别针对不同的CQ算法给出了7种不同的实现方案．通过试验，分别对不同算法及其方案的重建精度和收敛速度进行了对比分析，并对多重集合分裂可行性问题算法中约束权因子的选取及其对输出的影响进行了研究，从而给出了CQ算法在稀疏角度CT图像重建问题中应用的最佳凸集定义方案．以此为基础，给出了所提出算法的最佳实现方案．试验结果表明，该算法收敛速度快，重建精度高，为多重集合分裂可行性问题及其改进算法在该重建问题上的应用提供了参考．
- CQ算法 /
- 多重集合分裂可行性问题 /
- 非空闭凸集 /
- 图像重建
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

HTML全文

参考文献(12)

[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.