2 October 2013 Simplified Katsevich algorithm motivated by the distribution properties of k-lines
Author Affiliations +
J. of Electronic Imaging, 22(4), 043002 (2013). doi:10.1117/1.JEI.22.4.043002
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.
© 2013 SPIE and IS&T
Zhiwei Qiao, Gage Redler, Howard Halpern, "Simplified Katsevich algorithm motivated by the distribution properties of k-lines," Journal of Electronic Imaging 22(4), 043002 (2 October 2013). http://dx.doi.org/10.1117/1.JEI.22.4.043002


Detection and tracking algorithms

Reconstruction algorithms

Computed tomography

Algorithm development

Computer simulations

Numerical analysis


Fiber optic plethysmography
Proceedings of SPIE (August 01 1992)
Precision vacuum spectral reflectivity test system
Proceedings of SPIE (November 18 2014)
X-ray phase laminography with Talbot interferometer
Proceedings of SPIE (September 20 2010)

Back to Top