Regular Articles

Simplified Katsevich algorithm motivated by the distribution properties of k-lines

[+] Author Affiliations
Zhiwei Qiao

North University of China, School of Electronics and Computer Science and Technology, Taiyuan, Shanxi 030051, China

University of Chicago, Department of Radiation and Cellular Oncology, Chicago, Illinois 60637

Gage Redler

University of Chicago, Department of Radiation and Cellular Oncology, Chicago, Illinois 60637

Howard Halpern

University of Chicago, Department of Radiation and Cellular Oncology, Chicago, Illinois 60637

J. Electron. Imaging. 22(4), 043002 (Oct 02, 2013). doi:10.1117/1.JEI.22.4.043002
History: Received April 19, 2013; Revised July 9, 2013; Accepted August 22, 2013
Text Size: A A A

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 <21deg (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 <21deg, 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

Topics

Sensors

Citation

Zhiwei Qiao ; Gage Redler and Howard Halpern
"Simplified Katsevich algorithm motivated by the distribution properties of k-lines", J. Electron. Imaging. 22(4), 043002 (Oct 02, 2013). ; http://dx.doi.org/10.1117/1.JEI.22.4.043002


Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

PubMed Articles
Advertisement
  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.