New Complete-Data Spaces and Faster Algorithms for Penalized- Likelihood Emission Tomography
dc.contributor.author | Fessler, Jeffrey A. | en_US |
dc.contributor.author | Hero, Alfred 0. III | en_US |
dc.date.accessioned | 2011-08-18T18:20:50Z | |
dc.date.available | 2011-08-18T18:20:50Z | |
dc.date.issued | 1993-10-31 | en_US |
dc.identifier.citation | Fessler, J. A.; Hero, A. 0. III (1993). "New Complete-Data Spaces and Faster Algorithms for Penalized- Likelihood Emission Tomography." IEEE Conference Record of Nuclear Science Symposium and Medical Imaging Conference 3: 1897-1901. <http://hdl.handle.net/2027.42/85834> | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/85834 | |
dc.description.abstract | The classical expectation-maximization (EM) algorithm for image reconstruction suffers from particularly slow convergence when additive background effects such as accidental coincidences and scatter are included. In addition, when smoothness penalties are included in the objective function, the M-step of the EM algorithm becomes intractable due to parameter coupling. The authors describe the space-alternating generalized EM (SAGE) algorithm, in which the parameters are updated sequentially using a sequence of small “hidden” data spaces rather than one large complete-data space. The sequential update decouples the M-step, so the maximization can typically be performed analytically. By choosing hidden-data spaces with considerably less Fisher information than the conventional complete-data space for Poisson data, the authors obtain significant improvements in convergence rate. This acceleration is due to statistical considerations, not to numerical overrelaxation methods, so monotonic increases in the objective function and global convergence are guaranteed. Due to the space constraints, the authors focus on the unpenalized case in this summary, and they eliminate derivations that are similar to those in Lange and Carson, J. Comput. Assist. Tomography, vol. 8, no. 2, p.306-16 (1984). | en_US |
dc.publisher | IEEE | en_US |
dc.title | New Complete-Data Spaces and Faster Algorithms for Penalized- Likelihood Emission Tomography | en_US |
dc.type | article | en_US |
dc.subject.hlbsecondlevel | Biomedical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Dept. of Electrical Engineering and Computer Science. | en_US |
dc.identifier.pmid | 8299862 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/85834/1/Fessler125.pdf | |
dc.identifier.doi | 10.1109/NSSMIC.1993.373624 | en_US |
dc.identifier.source | IEEE Conference Record of Nuclear Science Symposium and Medical Imaging Conference | en_US |
dc.owningcollname | Electrical Engineering and Computer Science, Department of (EECS) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.