By Topic

Minimum square-deviation tomographic reconstruction from few projections

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

2 Author(s)
Dhararnipragada, S. ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; Arun, K.S.

The problem of tomographic reconstruction from a few discrete projections is addressed. When the projection data are discrete and few in number, the image formed by the convolution back-projection algorithm may not be consistent with the observed projections and is known to exhibit artifacts. Hence, the problem formulated here is one of finding an image that is closest to a nominal and is consistent with the projection data and other convex constraints such as positivity. The measure of closeness used is a Hilbert space norm, typically a weighted sum/integral of squares, with weights used to reflect expected deviation from the nominal in different regions. In the absence of constraints, this approach leads to a direct, noniterative algorithm (based on a simple matrix-vector computation) for construction of the image. When additional convex constraints such as positivity and upper-bounds need to be enforced on the reconstructed image to improve resolution, a quadratically convergent Newton algorithm is suggested

Published in:

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

Date of Conference:

14-17 Jun 1992