Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
Recently, Katsevich proposed the first exact helical cone-beam reconstruction algorithm that takes longitudinally truncated data collected from part of a scanning turn. A key theoretical basis is that any point inside the scanning helix belongs to one and only one PI-line. Unfortunately, he only provided a general formulation and did not describe the implementation details. To make this complicated algorithm more transparent, we report here specifically how to program the Katsevich algorithm in the planar detector geometry. As an important component, we also analyze the effects of various implementation parameters on the image quality. Our results are intended to be valuable for those who are interested in evaluating, improving and extending the Katsevich approach.
Journal of X-Ray Science and Technology – IOS Press
Published: Jan 1, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.