By Topic

Error analysis and performance optimization of fast hierarchical backprojection algorithms

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)
Basu, S. ; Gen. Electr. Corp. Res. & Dev. Center, Niskayuna, NY, USA ; Bresler, Y.

Basu and Bresler (2000) proposed a novel fast backprojection algorithm for reconstruction of an N×N pixel object from O(N) projections in O(N2log2N) operations. In this paper, we analyze a simplified version of that algorithm, to determine the effects of various parameter choices on the algorithm's theoretical performance. We derive a bound on the variance of the per-pixel error introduced by using hierarchical backprojection. This bound is with respect to an ensemble of input sinograms, and allows us to construct confidence intervals (for any specified level) for the per-pixel errors. The bound has a simple form, and we show how to use it to select algorithm parameters for different cost versus error tradeoffs. Simulation results show that the bound accurately predicts the performance of the algorithm over a wide range of parameter choices. These results are verified for different images, including a tomographic reconstruction from the visual human dataset (VHD). The analysis therefore provides an effective tool for the selection of parameters and operating point for the fast hierarchical backprojection algorithm

Published in:

Image Processing, IEEE Transactions on  (Volume:10 ,  Issue: 7 )