Iterative CT reconstruction using coordinate descent with ordered subsets of data

F. Noo, K. Hahn, H. Schöndube, K. Stierstorfer
{"title":"Iterative CT reconstruction using coordinate descent with ordered subsets of data","authors":"F. Noo, K. Hahn, H. Schöndube, K. Stierstorfer","doi":"10.1117/12.2217558","DOIUrl":null,"url":null,"abstract":"Image reconstruction based on iterative minimization of a penalized weighted least-square criteria has become an important topic of research in X-ray computed tomography. This topic is motivated by increasing evidence that such a formalism may enable a significant reduction in dose imparted to the patient while maintaining or improving image quality. One important issue associated with this iterative image reconstruction concept is slow convergence and the associated computational effort. For this reason, there is interest in finding methods that produce approximate versions of the targeted image with a small number of iterations and an acceptable level of discrepancy. We introduce here a novel method to produce such approximations: ordered subsets in combination with iterative coordinate descent. Preliminary results demonstrate that this method can produce, within 10 iterations and using only a constant image as initial condition, satisfactory reconstructions that retain the noise properties of the targeted image.","PeriodicalId":228011,"journal":{"name":"SPIE Medical Imaging","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPIE Medical Imaging","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2217558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Image reconstruction based on iterative minimization of a penalized weighted least-square criteria has become an important topic of research in X-ray computed tomography. This topic is motivated by increasing evidence that such a formalism may enable a significant reduction in dose imparted to the patient while maintaining or improving image quality. One important issue associated with this iterative image reconstruction concept is slow convergence and the associated computational effort. For this reason, there is interest in finding methods that produce approximate versions of the targeted image with a small number of iterations and an acceptable level of discrepancy. We introduce here a novel method to produce such approximations: ordered subsets in combination with iterative coordinate descent. Preliminary results demonstrate that this method can produce, within 10 iterations and using only a constant image as initial condition, satisfactory reconstructions that retain the noise properties of the targeted image.
基于有序数据子集的坐标下降迭代CT重建
基于惩罚加权最小二乘准则迭代最小化的图像重建已成为x射线计算机断层扫描研究的一个重要课题。越来越多的证据表明,这种形式可以在保持或改善图像质量的同时显着减少给予患者的剂量,从而激发了本主题。与这种迭代图像重建概念相关的一个重要问题是缓慢的收敛和相关的计算量。由于这个原因,有兴趣寻找方法产生目标图像的近似版本,迭代次数少,差异程度可接受。本文提出了一种新的逼近方法:有序子集与迭代坐标下降相结合。初步结果表明,该方法可以在10次迭代内,仅以恒定图像为初始条件,产生令人满意的重建,并保留目标图像的噪声特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信