Globally convergent image reconstruction for emission tomography using relaxed ordered subsets algorithms.
We present two types of globally convergent relaxed ordered subsets (OS) algorithms for penalized-likelihood image reconstruction in emission tomography: modified block sequential regularized expectation-maximization (BSREM) and relaxed OS separable paraboloidal surrogates (OS-SPS). The global convergence proof of the existing BSREM (De Pierro and Yamagishi, 2001) required a few a posteriori assumptions. By modifying the scaling functions of BSREM, we are able to prove the convergence of the modified BSREM under realistic assumptions. Our modification also makes stepsize selection more convenient. In addition, we introduce relaxation into the OS-SPS algorithm (Erdoğan and Fessler, 1999) that otherwise would converge to a limit cycle. We prove the global convergence of diagonally scaled incremental gradient methods of which the relaxed OS-SPS is a special case; main results of the proofs are from (Nedić and Bertsekas, 2001) and (Correa and Lemaréchal, 1993). Simulation results showed that both new algorithms achieve global convergence yet retain the fast initial convergence speed of conventional unrelaxed ordered subsets algorithms.
Ahn
Sangtae
S
Electrical Engineering and Computer Science Department, University of Michigan, 4415 Electrical Engineering and Computer Science Building, 1301 Beal Avenue, Ann Arbor, MI 48109-2122, USA. sangtaea@umich.edu
Fessler
Jeffrey A
JA
D000465:Algorithms; D001921:Brain / Q000000981:diagnostic imaging; D003198:Computer Simulation; D007089:Image Enhancement / Q000379:methods*; D019047:Phantoms, Imaging; D011786:Quality Control; D014055:Tomography, Emission-Computed / Q000295:instrumentation / Q000379:methods*; D015899:Tomography, Emission-Computed, Single-Photon / Q000379:methods