Unified Framework to Construct Fast Row-Action-Type Iterative CT Reconstruction Methods with Total Variation Using Multi Proximal Splitting

Heejeong Kim, Kazuya Sadakata, H. Kudo
{"title":"Unified Framework to Construct Fast Row-Action-Type Iterative CT Reconstruction Methods with Total Variation Using Multi Proximal Splitting","authors":"Heejeong Kim, Kazuya Sadakata, H. Kudo","doi":"10.1145/3484424.3484435","DOIUrl":null,"url":null,"abstract":"Recently, to realize low-dose scan in CT imaging, a number of iterative reconstruction methods with Total Variation (TV) regularization have been investigated. In particular, reconstruction methods based on proximal splitting framework have been actively researched thanks to the following two reasons. First, they allow to use the TV regularization term, which is known to be a non-differentiable function that cannot be handled with classical optimization methods. Second, using the proximal splitting leads to a new class of iterative reconstruction methods which cannot be found in the literature. The major drawback of existing research in this direction is that most of them use the proximal splitting which divides the cost function into a sum of only two terms like famous Chambolle-Pock algorithm and FISTA. In this paper, we propose a unified framework to construct a class of row-action-type iterative methods which converge very fast using frameworks of multi proximal splitting which divides the cost function into a sum of arbitrary number of sub-cost functions (more than two). The use of multi proximal splitting naturally allows us to construct row-action-type iterative methods converging to an exact minimizer of the cost function very quickly. In mathematical literature, there exist only three different frameworks of multi proximal splitting, which are the Passty splitting, Dykstra-like splitting, and modified Dykstra-like splitting. We develop three new iterative methods, i.e. the Passty iterative method, Dykstra-like iterative method, and modified Dykstra-like iterative method, by using these frameworks, for the case where the cost function is a sum of the standard least-squares data fidelity and the TV regularization term. We have compared the proposed three iterative methods with an empirical standard method using ordered-subset technique called OS-SIRT-TV method. The results demonstrate that the performances of proposed methods significantly outperform OS-SIRT method in terms of image quality with a comparable convergence speed.","PeriodicalId":225954,"journal":{"name":"Proceedings of the 6th International Conference on Biomedical Signal and Image Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on Biomedical Signal and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3484424.3484435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, to realize low-dose scan in CT imaging, a number of iterative reconstruction methods with Total Variation (TV) regularization have been investigated. In particular, reconstruction methods based on proximal splitting framework have been actively researched thanks to the following two reasons. First, they allow to use the TV regularization term, which is known to be a non-differentiable function that cannot be handled with classical optimization methods. Second, using the proximal splitting leads to a new class of iterative reconstruction methods which cannot be found in the literature. The major drawback of existing research in this direction is that most of them use the proximal splitting which divides the cost function into a sum of only two terms like famous Chambolle-Pock algorithm and FISTA. In this paper, we propose a unified framework to construct a class of row-action-type iterative methods which converge very fast using frameworks of multi proximal splitting which divides the cost function into a sum of arbitrary number of sub-cost functions (more than two). The use of multi proximal splitting naturally allows us to construct row-action-type iterative methods converging to an exact minimizer of the cost function very quickly. In mathematical literature, there exist only three different frameworks of multi proximal splitting, which are the Passty splitting, Dykstra-like splitting, and modified Dykstra-like splitting. We develop three new iterative methods, i.e. the Passty iterative method, Dykstra-like iterative method, and modified Dykstra-like iterative method, by using these frameworks, for the case where the cost function is a sum of the standard least-squares data fidelity and the TV regularization term. We have compared the proposed three iterative methods with an empirical standard method using ordered-subset technique called OS-SIRT-TV method. The results demonstrate that the performances of proposed methods significantly outperform OS-SIRT method in terms of image quality with a comparable convergence speed.
基于多近端分裂构建全变分快速行动作型迭代CT重建方法的统一框架
近年来,为了实现CT成像中的低剂量扫描,研究了一些全变分(TV)正则化的迭代重建方法。特别是基于近端分裂框架的重建方法,由于以下两个原因得到了积极的研究。首先,它们允许使用TV正则化项,这是一个不可微的函数,不能用经典的优化方法处理。其次,使用近端分裂导致了一类新的迭代重建方法,这在文献中是找不到的。该方向现有研究的主要缺点是大多采用近端分割法,将代价函数分解为仅包含两项的和,如著名的Chambolle-Pock算法和FISTA算法。在本文中,我们提出了一个统一的框架来构造一类快速收敛的行动作型迭代方法,该框架使用多近端分裂框架将代价函数划分为任意数目的子代价函数(多于两个)的和。多近端分裂的使用自然使我们能够构造行-动作类型的迭代方法,很快收敛到代价函数的精确最小值。在数学文献中,多近端分裂只存在三种不同的框架,分别是Passty分裂、Dykstra-like分裂和改进的Dykstra-like分裂。针对代价函数为标准最小二乘数据保真度与TV正则化项之和的情况,利用这些框架提出了三种新的迭代方法,即Passty迭代法、类dykstra迭代法和改进的类dykstra迭代法。我们将提出的三种迭代方法与使用有序子集技术的经验标准方法(称为OS-SIRT-TV方法)进行了比较。结果表明,在收敛速度相当的情况下,所提出的方法在图像质量方面明显优于OS-SIRT方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信