Accelerating the EMML algorithm and related iterative algorithms by rescaled block-iterative methods
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 7 (1) , 100-109
- https://doi.org/10.1109/83.650854
Abstract
Analysis of convergence of the algebraic reconstruction technique (ART) shows it to be predisposed to converge to a solution faster than simultaneous methods, such as those of the Cimmino-Landweber (1992) type, the expectation maximization maximum likelihood method for the Poisson model (EMML), and the simultaneous multiplicative ART (SMART), which use all the data at each step. Although the choice of ordering of the data and of relaxation parameters are important, as Herman and Meyer (1993) have shown, they are not the full story. The analogous multiplicative ART (MART), which applies only to systems y=Px in which y>0, P/spl ges/0 and a nonnegative solution is sought, is also sequential (or "row-action"), rather than simultaneous, but does not generally exhibit the same accelerated convergence relative to its simultaneous version, SMART. By dividing each equation by the maximum of the corresponding row of P, we find that this rescaled MART (RMART) does converge faster, when solutions exist, significantly so in cases in which the row maxima are substantially less than one. Such cases arise frequently in tomography and when the columns of P have been normalized to have sum one. Between simultaneous methods, which use all the data at each step, and sequential (or row-action) methods, which use only a single data value at each step, there are the block-iterative (or ordered subset) methods, in which a single block or subset of the data is processed at each step. The ordered subset EM (OSEM) of Hudson et al. (see IEEE Trans. Med. Imag., vol.13, p.601-9, 1994) is significantly faster than the EMML, but often fails to converge. The "rescaled block-iterative" EMML (RBI-EMML) is an accelerated block-iterative version of EMML that converges, in the consistent case, to a solution, for any choice of subsets; it reduces to OSEM when the restrictive "subset balanced" condition holds. Rescaled block-iterative versions of SMART and MART also exhibit accelerated convergence.Keywords
This publication has 30 references indexed in Scilit:
- Choice of initial conditions in the ML reconstruction for transmission CT with truncated projection dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Ionospheric tomography via iterative cross‐entropy minimizationRadio Science, 1997
- A row-action alternative to the EM algorithm for maximizing likelihood in emission tomographyIEEE Transactions on Medical Imaging, 1996
- Iterative Reconstruction Algorithms Based on Cross-Entropy MinimizationPublished by Springer Nature ,1996
- Iterative image reconstruction algorithms based on cross-entropy minimizationIEEE Transactions on Image Processing, 1993
- Acceleration of Landweber-type algorithms by suppression of projection on the maximum singular vectorIEEE Transactions on Medical Imaging, 1992
- On the Iterative Image Space Reconstruction Algorthm for ECTIEEE Transactions on Medical Imaging, 1987
- Simultaneous Algebraic Reconstruction Technique (SART): A Superior Implementation of the Art AlgorithmUltrasonic Imaging, 1984
- Iterative methods for the three-dimensional reconstruction of an object from projectionsJournal of Theoretical Biology, 1972
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951