By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kudo, H. ; Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan ; Park, S. ; Noo, F. ; Defrise, M.

Concerns the problem of tomographic reconstruction from axially truncated cone-beam projections acquired with a helical vertex path. H. Kudo et al. (1998) developed a quasi-exact filtered backprojection algorithm for this problem. This paper evaluates the performance of the quasi-exact algorithm by comparing it with variants of the approximate Feldkamp (1984) algorithm. The results show that the quasi-exact algorithm possesses the following 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 that is 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 computation time, which is much longer than for the Feldkamp algorithm

Published in:

Nuclear Science, IEEE Transactions on  (Volume:46 ,  Issue: 3 )