Abstract

The expectation-maximization (EM) algorithm for maximum-likelihood image recovery is guaranteed to converge, but it converges slowly. Its ordered-subset version (OS-EM) is used widely in tomographic image reconstruction because of its order-of-magnitude acceleration compared with the EM algorithm, but it does not guarantee convergence. Recently the ordered-subset, separable-paraboloidal-surrogate (OS-SPS) algorithm with relaxation has been shown to converge to the optimal point while providing fast convergence. We adapt the relaxed OS-SPS algorithm to the problem of image restoration. Because data acquisition in image restoration is different from that in tomography, we employ a different strategy for choosing subsets, using pixel locations rather than projection angles. Simulation results show that the relaxed OS-SPS algorithm can provide an order-of-magnitude acceleration over the EM algorithm for image restoration. This new algorithm now provides the speed and guaranteed convergence necessary for efficient image restoration.

© 2003 Optical Society of America

Fast maximum-likelihood image-restoration algorithms for three- dimensional fluorescence microscopy

Joanne Markham and José-Angel Conchello
J. Opt. Soc. Am. A 18(5) 1062-1071 (2001)

Penalized-likelihood image reconstruction for digital holography

Saowapak Sotthivirat and Jeffrey A. Fessler
J. Opt. Soc. Am. A 21(5) 737-750 (2004)

Acceleration of maximum-likelihood image restoration for fluorescence microscopy and other noncoherent imagery

Timothy J. Holmes and Yi-Hwa Liu
J. Opt. Soc. Am. A 8(6) 893-907 (1991)

Maximum-likelihood image restoration adapted for noncoherent optical imaging

Timothy J. Holmes
J. Opt. Soc. Am. A 5(5) 666-673 (1988)

Image restoration with the Viterbi algorithm

Casey Miller, Bobby R. Hunt, Michael W. Marcellin, and Mark A. Neifeld
J. Opt. Soc. Am. A 17(2) 265-275 (2000)