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

The importance of preconditioners in fast Poisson-based iterative reconstruction algorithms for SPECT

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)
Lalush, D.S. ; Dept. of Biomed. Eng., North Carolina Univ., Chapel Hill, NC, USA ; Tsui, B.M.W.

We study the effects of different preconditioners on Poisson-based iterative reconstruction algorithms. Preconditioners are linear transformations that map the image solution space for the reconstruction problem into a space where the likelihood function can be more efficiently optimized. We apply preconditioners to conjugate gradient (CG) algorithms seeking to optimize the Poisson log likelihood function for SPECT. We show that, without a preconditioner, such algorithms may converge more slowly than the ML-EM algorithm. Previous research has applied a preconditioner that depends on the current iteration's image estimate. However, these algorithms do not generate conjugate step directions and do not obtain the full benefit of the CG algorithm's speed. We propose a preconditioner that depends only on the measured projection data and remains constant with each iteration, thus generating nearly conjugate step directions. We show that our method optimizes the log likelihood function more efficiently than the previously proposed methods. We also show that, if the measured projection data contains few zero or near-zero projection bins, the Poisson CG algorithms have convergence rates comparable with those from weighted least-squares (WLS-CG) algorithms. We conclude that the performance of Poisson CG algorithms depends heavily on the preconditioner chosen, and that they can be made competitive with WLS-CG by manipulation of the preconditioners

Published in:

Nuclear Science Symposium and Medical Imaging Conference Record, 1995., 1995 IEEE  (Volume:3 )

Date of Conference:

21-28 Oct 1995

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.