Grouped-Coordinate Ascent Algorithms for Penalized-Likelihood Transmission Image Reconstruction (1996)
Cached
Download Links
- [ftp.eecs.umich.edu]
- [www.eecs.umich.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Tr. Med. Im |
| Citations: | 39 - 18 self |
BibTeX
@ARTICLE{Fessler96grouped-coordinateascent,
author = {Jeffrey A. Fessler and Edward P. Ficaro and Neal H. Clinthorne and Kenneth Lange},
title = {Grouped-Coordinate Ascent Algorithms for Penalized-Likelihood Transmission Image Reconstruction},
journal = {IEEE Tr. Med. Im},
year = {1996},
volume = {16},
pages = {166--175}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a new class of algorithms for penalized-likelihood reconstruction of attenuation maps from lowcount transmission scans. We derive the algorithms by applying to the transmission log-likelihood a version of the convexity technique developed by De Pierro for emission tomography. The new class includes the single-coordinate ascent (SCA) algorithmand Lange's convex algorithm for transmission tomography as special cases. The new grouped-coordinate ascent (GCA) algorithms in the class overcome several limitations associated with previous algorithms. (1) Fewer exponentiations are required than in the transmission ML-EM algorithm or in the SCA algorithm. (2) The algorithms intrinsically accommodate nonnegativity constraints, unlike many gradientbased methods. (3) The algorithms are easily parallelizable, unlike the SCA algorithm and perhaps line-search algorithms. We show that the GCA algorithms converge faster than the SCA algorithm, even on conventional workstations. An ex...
