By Topic

Accelerating the EM algorithm using rescaled block-iterative methods

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

5 Author(s)
Byrne, C. ; Dept. of Math. Sci., Univ. of Massachusetts, Lowell, MA, USA ; Soares, E. ; Pan, T.-S. ; Glick, S.
more authors

Block-iterative methods, in which only part of the data is used at each step, can converge significantly faster than simultaneous methods, such as EMML or SMART, in which all the data is employed at each step. The authors discuss the rescaled block-iterative (RBI) approach to both algorithms. When a nonnegative solution exists, these RBI algorithms converge to a solution for any configuration of subsets. The RBI-EMML reduces to the “ordered subset” method when “subset balance” holds. When there is no nonnegative solution block-iterative methods produce limit cycles, from which an approximate solution can be obtained using a “feedback” approach

Published in:

Nuclear Science Symposium, 1996. Conference Record., 1996 IEEE  (Volume:3 )

Date of Conference:

2-9 Nov 1996