通过收敛基元-二元算法去除非凸加权变分金属伪影

Lianfang Wang, Zhangling Chen, Zhifang Liu, Yutong Li, Yunsong Zhao, Hongwei Li, Huibin Chang
{"title":"通过收敛基元-二元算法去除非凸加权变分金属伪影","authors":"Lianfang Wang, Zhangling Chen, Zhifang Liu, Yutong Li, Yunsong Zhao, Hongwei Li, Huibin Chang","doi":"10.1088/1361-6420/ad2694","DOIUrl":null,"url":null,"abstract":"\n Direct reconstruction through filtered back projection engenders metal artifacts in polychromatic computed tomography images, attributed to highly attenuating implants, which further poses great challenges for subsequent image analysis. Inpainting the metal trace directly in the Radon domain for the extant variational method leads to strong edge diffusion and potential inherent artifacts. With normalization based on pre-segmentation, the inpainted outcome can be notably ameliorated. However, its reconstructive fidelity is heavily contingent on the precision of the pre-segmentation, and highly accurate segmentation of images with metal artifacts is non-trivial in actuality. In this paper, we propose a nonconvex weighted variational approach for metal artifact reduction. Specifically, in lieu of employing a binary function with zeros in the metal trace, an adaptive weight function is designed in the Radon domain, with zeros in the overlapping regions of multiple disjoint metals as well as areas of highly attenuated projections, and the inverse square root of the measured projection in other regions. A nonconvex $L^1-\\alpha L^2$ regularization term is incorporated to further enhance edge contrast, alongside a box-constraint in the image domain. Efficient first-order primal-dual algorithms, proven to be globally convergent and of low computational cost owing to the closed-form solution of all subproblems, are devised to resolve such a constrained nonconvex model. Both simulated and real experiments are conducted with comparisons to other variational algorithms, validating the superiority of the presented method. Especially in comparison to the reweighted JSR, our proposed algorithm can curtail the total computational cost to at most one-third, and for the case of inaccurate pre-segmentation, the recovery outcomes by the proposed algorithms are notably enhanced.","PeriodicalId":508687,"journal":{"name":"Inverse Problems","volume":"20 12","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nonconvex weighted variational metal artifacts removal via convergent primal-dual algorithms\",\"authors\":\"Lianfang Wang, Zhangling Chen, Zhifang Liu, Yutong Li, Yunsong Zhao, Hongwei Li, Huibin Chang\",\"doi\":\"10.1088/1361-6420/ad2694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Direct reconstruction through filtered back projection engenders metal artifacts in polychromatic computed tomography images, attributed to highly attenuating implants, which further poses great challenges for subsequent image analysis. Inpainting the metal trace directly in the Radon domain for the extant variational method leads to strong edge diffusion and potential inherent artifacts. With normalization based on pre-segmentation, the inpainted outcome can be notably ameliorated. However, its reconstructive fidelity is heavily contingent on the precision of the pre-segmentation, and highly accurate segmentation of images with metal artifacts is non-trivial in actuality. In this paper, we propose a nonconvex weighted variational approach for metal artifact reduction. Specifically, in lieu of employing a binary function with zeros in the metal trace, an adaptive weight function is designed in the Radon domain, with zeros in the overlapping regions of multiple disjoint metals as well as areas of highly attenuated projections, and the inverse square root of the measured projection in other regions. A nonconvex $L^1-\\\\alpha L^2$ regularization term is incorporated to further enhance edge contrast, alongside a box-constraint in the image domain. Efficient first-order primal-dual algorithms, proven to be globally convergent and of low computational cost owing to the closed-form solution of all subproblems, are devised to resolve such a constrained nonconvex model. Both simulated and real experiments are conducted with comparisons to other variational algorithms, validating the superiority of the presented method. Especially in comparison to the reweighted JSR, our proposed algorithm can curtail the total computational cost to at most one-third, and for the case of inaccurate pre-segmentation, the recovery outcomes by the proposed algorithms are notably enhanced.\",\"PeriodicalId\":508687,\"journal\":{\"name\":\"Inverse Problems\",\"volume\":\"20 12\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Inverse Problems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/1361-6420/ad2694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inverse Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1361-6420/ad2694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在多色计算机断层扫描图像中,通过滤波背投影直接重建会产生金属伪影,这是由于高度衰减的植入物造成的,这进一步给后续图像分析带来了巨大挑战。对于现有的变异方法,直接在拉顿域中绘制金属痕迹会导致强烈的边缘扩散和潜在的固有伪影。在预分割的基础上进行归一化处理,可以明显改善涂抹结果。然而,其重建保真度在很大程度上取决于预分割的精确度,而对带有金属伪影的图像进行高精度分割在实际操作中并非易事。在本文中,我们提出了一种用于减少金属伪影的非凸加权变分方法。具体来说,我们在 Radon 域设计了一个自适应权重函数,在多个不相交金属的重叠区域以及高度衰减的投影区域设置零点,而在其他区域则设置测量投影的平方根,以此取代在金属轨迹中设置零点的二进制函数。为了进一步增强边缘对比度,在图像域中还加入了一个非凸的 $L^1-\alpha L^2$ 正则项和一个盒约束。由于所有子问题的闭式求解,高效的一阶初等二元算法被证明具有全局收敛性和较低的计算成本。通过与其他变分算法的比较,进行了模拟和实际实验,验证了所提出方法的优越性。特别是与重新加权的 JSR 相比,我们提出的算法最多可将总计算成本减少到三分之一,而且对于预分割不准确的情况,提出的算法的恢复结果明显提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nonconvex weighted variational metal artifacts removal via convergent primal-dual algorithms
Direct reconstruction through filtered back projection engenders metal artifacts in polychromatic computed tomography images, attributed to highly attenuating implants, which further poses great challenges for subsequent image analysis. Inpainting the metal trace directly in the Radon domain for the extant variational method leads to strong edge diffusion and potential inherent artifacts. With normalization based on pre-segmentation, the inpainted outcome can be notably ameliorated. However, its reconstructive fidelity is heavily contingent on the precision of the pre-segmentation, and highly accurate segmentation of images with metal artifacts is non-trivial in actuality. In this paper, we propose a nonconvex weighted variational approach for metal artifact reduction. Specifically, in lieu of employing a binary function with zeros in the metal trace, an adaptive weight function is designed in the Radon domain, with zeros in the overlapping regions of multiple disjoint metals as well as areas of highly attenuated projections, and the inverse square root of the measured projection in other regions. A nonconvex $L^1-\alpha L^2$ regularization term is incorporated to further enhance edge contrast, alongside a box-constraint in the image domain. Efficient first-order primal-dual algorithms, proven to be globally convergent and of low computational cost owing to the closed-form solution of all subproblems, are devised to resolve such a constrained nonconvex model. Both simulated and real experiments are conducted with comparisons to other variational algorithms, validating the superiority of the presented method. Especially in comparison to the reweighted JSR, our proposed algorithm can curtail the total computational cost to at most one-third, and for the case of inaccurate pre-segmentation, the recovery outcomes by the proposed algorithms are notably enhanced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信