By Topic

Pixel based reconstruction (PBR) techniques

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

2 Author(s)
K. V. Peddanarappagari ; Virginia Univ., Charlottesville, VA, USA ; R. S. Fager

The authors have reinvestigated algebraic reconstruction algorithms for computed tomography, with some new heuristics and some new methodologies, which indicate that they merit serious consideration for practical applications. Methods of implementing these iterative methods more efficiently by reducing the computations, reducing memory requirement, and using accelerating techniques are discussed. It is shown by simulations, using the pixel-based reconstruction (PBR) methods proposed by R.S. Fager et al., that excellent reconstructions of a complex object can be obtained with very few projections. PBR methods are simultaneous in nature, i.e. at each iteration, any pixel value does not depend on any other pixel value in the reconstructed image. Because of this, in principle, each pixel can be assigned to its own computer and advantage can be taken of parallel structured computers. Two methods of improving these algorithms have been investigated: region of interest; and the steepest descent approach

Published in:

Computer-Based Medical Systems, 1992. Proceedings., Fifth Annual IEEE Symposium on

Date of Conference:

14-17 Jun 1992