Stable and efficient shift-variant algorithm for circle-plus-lines orbits in cone-beam CT

F. Noo, M. Defrise, R. Clackdoyle, E. J. Roney, T. White, S. Galbraith
{"title":"Stable and efficient shift-variant algorithm for circle-plus-lines orbits in cone-beam CT","authors":"F. Noo, M. Defrise, R. Clackdoyle, E. J. Roney, T. White, S. Galbraith","doi":"10.1109/ICIP.1996.560551","DOIUrl":null,"url":null,"abstract":"Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd IEEE International Conference on Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1996.560551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers.
锥束CT中圆加线轨道稳定高效的移位变算法
Defrise和Clack(参见IEEE Trans)。地中海,图像放大。,第13卷,第186-95页,1994年),以及工藤和斋藤(见IEEE翻译。地中海,图像放大。, vol.13, p.196-211, 1994),推导出一种精确的算法,适合于精确地重建从任何完整轨道获得的锥束数据。这些算法以移位变滤波后的反向投影的形式编写。它们的主要特点是能够以许多不同的方式处理锥束数据集固有的冗余。我们研究了冗余处理与算法的稳定性和效率之间的相互作用。具体来说,我们展示了如何处理冗余,将一些投影的位移变滤波变成位移不变滤波。利用这一结果,我们定义了一种适合于准确、高效地重建圆加线轨道数据的新算法。在废容器工业成像的模拟数据和真实数据上对新算法进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信