Performance of quasi-exact cone-beam filtered backprojection algorithm for axially truncated helical data

1998 IEEE Nuclear Science Symposium Conference Record. 1998 IEEE Nuclear Science Symposium and Medical Imaging Conference (Cat. No.98CH36255) Pub Date : 1998-11-08 DOI:10.1109/NSSMIC.1998.771651

H. Kudo, S. Park, F. Noo, M. Defrise

{"title":"Performance of quasi-exact cone-beam filtered backprojection algorithm for axially truncated helical data","authors":"H. Kudo, S. Park, F. Noo, M. Defrise","doi":"10.1109/NSSMIC.1998.771651","DOIUrl":null,"url":null,"abstract":"Concerns the problem of tomographic reconstruction from axially truncated cone-beam projections acquired with a helical vertex path. Very recently, Kudo et al. (J. Opt. Soc. Am. A, vol. 1, p. 612-19, 1984) developed a quasi-exact filtered backprojection algorithm for this problem. The purpose of this paper is to evaluate the performances of the quasi-exact algorithm by comparing it with variants of the approximate Feldkamp algorithm. The results show that the quasi-exact algorithm possesses the following two advantages over the Feldkamp algorithm. The first advantage is the improved image quality when the pitch of the helix is large. The second advantage is the use of a detector area close to the minimum detector area compatible with exact reconstruction. This area is shown to be much smaller than that required by the Feldkamp algorithm for typical geometries. One disadvantage of the quasi-exact algorithm is the computational time which is much longer than for the Feldkamp algorithm.","PeriodicalId":129202,"journal":{"name":"1998 IEEE Nuclear Science Symposium Conference Record. 1998 IEEE Nuclear Science Symposium and Medical Imaging Conference (Cat. No.98CH36255)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE Nuclear Science Symposium Conference Record. 1998 IEEE Nuclear Science Symposium and Medical Imaging Conference (Cat. No.98CH36255)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSSMIC.1998.771651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

Abstract

Concerns the problem of tomographic reconstruction from axially truncated cone-beam projections acquired with a helical vertex path. Very recently, Kudo et al. (J. Opt. Soc. Am. A, vol. 1, p. 612-19, 1984) developed a quasi-exact filtered backprojection algorithm for this problem. The purpose of this paper is to evaluate the performances of the quasi-exact algorithm by comparing it with variants of the approximate Feldkamp algorithm. The results show that the quasi-exact algorithm possesses the following two advantages over the Feldkamp algorithm. The first advantage is the improved image quality when the pitch of the helix is large. The second advantage is the use of a detector area close to the minimum detector area compatible with exact reconstruction. This area is shown to be much smaller than that required by the Feldkamp algorithm for typical geometries. One disadvantage of the quasi-exact algorithm is the computational time which is much longer than for the Feldkamp algorithm.

查看原文本刊更多论文

轴向截断螺旋数据的准精确锥束滤波反投影算法性能

研究了利用螺旋顶点路径获得的轴向截顶锥束投影的层析重建问题。最近，Kudo et al. (J. Opt. Soc.)点。A, vol. 1, p. 612-19, 1984)为这个问题开发了一种准精确滤波反向投影算法。本文的目的是通过将拟精确算法与近似费尔德坎普算法的变体进行比较来评估其性能。结果表明，与费尔德坎普算法相比，准精确算法具有以下两个优点。第一个优点是当螺旋螺距较大时，图像质量得到改善。第二个优点是利用接近最小检测器区域的检测器区域与精确重构相兼容。这个区域比费尔德坎普算法对典型几何图形的要求要小得多。拟精确算法的一个缺点是计算时间比费尔德坎普算法长得多。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1998 IEEE Nuclear Science Symposium Conference Record. 1998 IEEE Nuclear Science Symposium and Medical Imaging Conference (Cat. No.98CH36255)

自引率

0.00%

发文量