Share Email Print

Journal of Electronic Imaging

Simplified Katsevich algorithm motivated by the distribution properties of k-lines
Author(s): Zhiwei Qiao; Gage Redler; Howard Halpern
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Katsevich algorithm is a breakthrough in the theoretically exact algorithms for helical cone beam computed tomography (CT). For future application in medical and industrial CT, determining how to implement it efficiently and accurately is the main task. We analyzed the slope law and intersection law of the k-lines, finding that the k-lines are not intersecting if the half-maximal fan angle (HMFA) is <21  deg (numerical solution, so it is approximate) and that the helical pitch and HMFA determine the depth of parallelism of k-lines. Using an appropriate pitch and an HMFA that is <21  deg , one can use a simplified Katsevich algorithm, whose filtration process can be done on the rows of the detector panel so that the preweighting, pre-rebinning, post-rebinning, and postweighting steps are all canceled. Simulation experiments show that the simplified algorithm can obtain highly precise images at a faster speed. Our results are intended to be valuable to those who are working on efficient implementations of the Katsevich-type algorithms.

Paper Details

Date Published: 2 October 2013
PDF: 12 pages
J. Electron. Imag. 22(4) 043002 doi: 10.1117/1.JEI.22.4.043002
Published in: Journal of Electronic Imaging Volume 22, Issue 4
Show Author Affiliations
Zhiwei Qiao, North Univ. of China (Taiwan)
Gage Redler, Univ. of Illinois at Chicago (United States)
Howard Halpern, Univ. of Illinois at Chicago (United States)

© SPIE. Terms of Use
Back to Top