By Topic

Fast implementations of algebraic methods for three-dimensional reconstruction from cone-beam data

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
$33 $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

3 Author(s)
K. Mueller ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; R. Yagel ; J. J. Wheller

The prime motivation of this work is to devise techniques that make the algebraic reconstruction technique (ART) and related methods more efficient for routine clinical use, while not compromising their accuracy. Since most of the computational effort of ART is spent for projection/backprojection operations, the authors first seek to optimize the projection algorithm. Existing projection algorithms are surveyed and it is found that these algorithms either lack accuracy or speed, or are not suitable for cone-beam reconstruction. The authors hence devise a new and more accurate extension to the splatting algorithm, a well-known voxel-driven projection method. They also describe a new three-dimensional (3-D) ray-driven projector that is considerably faster than the voxel-driven projector and, at the same time, more accurate and perfectly suited for the demands of cone beam. The authors then devise caching schemes for both ART and simultaneous ART (SART), which minimize the number of redundant computations for projection and backprojection and, at the same time, are very memory conscious. They find that with caching, the cost for an ART projection/backprojection operation can be reduced to the equivalent cost of 1.12 projections. They also find that SART, due to its image-based volume correction scheme, is considerably harder to accelerate with caching. Implementations of the algorithms yield runtime ratios T SART/T ART between 1.5 and 1.15, depending on the amount of caching used.

Published in:

IEEE Transactions on Medical Imaging  (Volume:18 ,  Issue: 6 )