A simplified Katsevich algorithm motivated by the distribution properties of k-lines

Area of Science:

• Medical Imaging
• Computed Tomography
• Algorithm Development

Background:

• The Katsevich algorithm offers theoretical exactness for helical cone beam CT.
• Efficient and accurate implementation is crucial for practical medical and industrial CT applications.

Purpose of the Study:

• To analyze k-line properties and develop a simplified Katsevich algorithm.
• To investigate the impact of helical pitch and half maximal fan angle (HMFA) on algorithm implementation.

Main Methods:

• Analysis of k-line slope and intersection laws.
• Numerical determination of HMFA threshold for k-line non-intersection.
• Development and simulation of a simplified Katsevich algorithm.

Main Results:

• K-lines do not intersect when HMFA is below approximately 21 degrees.
• Helical pitch and HMFA dictate k-line parallelism.
• A simplified algorithm eliminates pre- and post-weighting/rebinning steps.
• Simulations demonstrate high precision and increased speed with the simplified algorithm.

Conclusions:

• A simplified Katsevich algorithm is feasible for CT implementations with HMFA < 21 degrees.
• This simplification significantly enhances computational efficiency and speed.
• The findings support the development of faster, more accurate CT imaging systems.