Cart (Loading....) | Create Account
Close category search window

Fast Exact/Quasi-Exact FBP Algorithms for Triple-Source Helical Cone-Beam CT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yang Lu ; Dept. of Biomed. Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Katsevich, A. ; Jun Zhao ; Hengyong Yu
more authors

Cardiac computed tomography (CT) has been improved over past years, but it still needs improvement for higher temporal resolution in the cases of high or irregular cardiac rates. Given successful applications of dual-source cardiac CT scanners, triple-source cone-beam CT seems a promising mode for cardiac CT. In this paper, we propose two filtered-backprojection algorithms for triple-source helical cone-beam CT. The first algorithm utilizes two families of filtering lines. These lines are parallel to the tangent of the scanning trajectory and the so-called L lines. The second algorithm utilizes two families of filtering lines tangent to the boundaries of the Zhao window and L lines, respectively, but it eliminates the filtering paths along the tangent of the scanning trajectory, thus reducing the required detector size greatly. The first algorithm is theoretically exact for r < 0.265 R and quasi-exact for 0.265 R ?? r < 0.495 R, and the second algorithm is quasi-exact for r < 0.495 R, where r and R denote the object radius and the trajectory radius, respectively. Both algorithms are computationally efficient. Numerical results are presented to verify and showcase the proposed algorithms.

Published in:

Medical Imaging, IEEE Transactions on  (Volume:29 ,  Issue: 3 )

Date of Publication:

March 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.