OSA's Digital Library

Journal of the Optical Society of America A

Journal of the Optical Society of America A

| OPTICS, IMAGE SCIENCE, AND VISION

  • Vol. 20, Iss. 3 — Mar. 1, 2003
  • pp: 439–449

Relaxed ordered-subset algorithm for penalized-likelihood image restoration

Saowapak Sotthivirat and Jeffrey A. Fessler  »View Author Affiliations


JOSA A, Vol. 20, Issue 3, pp. 439-449 (2003)
http://dx.doi.org/10.1364/JOSAA.20.000439


View Full Text Article

Enhanced HTML    Acrobat PDF (528 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

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

OCIS Codes
(100.0100) Image processing : Image processing
(100.1830) Image processing : Deconvolution
(100.2000) Image processing : Digital image processing
(100.3020) Image processing : Image reconstruction-restoration
(100.3190) Image processing : Inverse problems
(180.1790) Microscopy : Confocal microscopy

History
Original Manuscript: May 20, 2002
Revised Manuscript: October 14, 2002
Manuscript Accepted: October 15, 2002
Published: March 1, 2003

Citation
Saowapak Sotthivirat and Jeffrey A. Fessler, "Relaxed ordered-subset algorithm for penalized-likelihood image restoration," J. Opt. Soc. Am. A 20, 439-449 (2003)
http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-20-3-439


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. R. Richardson, “Bayesian-based iterative method of image restoration,” J. Opt. Soc. Am. 62, 55–59 (1972). [CrossRef]
  2. T. J. Holmes, “Maximum-likelihood image restoration adapted for noncoherent optical imaging,” J. Opt. Soc. Am. A 5, 666–673 (1988). [CrossRef]
  3. S. Joshi, M. I. Miller, “Maximum a posteriori estimation with Good’s roughness for three-dimensional optical-sectioning microscopy,” J. Opt. Soc. Am. A 10, 1078–1085 (1993). [CrossRef] [PubMed]
  4. R. G. Lane, “Methods for maximum-likelihood deconvolution,” J. Opt. Soc. Am. A 13, 1992–1998 (1996). [CrossRef]
  5. J. A. Conchello, J. G. McNally, “Fast regularization technique for expectation maximization algorithm for computational optical sectioning microscopy,” in Three-Dimensional and Multidimensional Microscopy: Image Acquisition and Processing, C. J. Cogswell, G. S. Kino, T. Wilson, eds., Proc. SPIE2655, 199–208 (1996). [CrossRef]
  6. A. P. Dempster, N. M. Laird, D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. R. Stat. Soc. B 39, 1–38 (1977).
  7. A. R. De Pierro, “A modified expectation maximization algorithm for penalized likelihood estimation in emission tomography,” IEEE Trans. Med. Imaging 14, 132–137 (1995). [CrossRef] [PubMed]
  8. H. M. Hudson, R. S. Larkin, “Accelerated image reconstruction using ordered subsets of projection data,” IEEE Trans. Med. Imaging 13, 601–609 (1994). [CrossRef] [PubMed]
  9. C. L. Byrne, “Accelerating the EMML algorithm and related iterative algorithms by rescaled block-iterative methods,” IEEE Trans. Image Process. 7, 100–109 (1998). [CrossRef]
  10. C. L. Byrne, “Convergent block-iterative algorithms for image reconstruction from inconsistent data,” IEEE Trans. Image Process. 6, 1296–1304 (1997). [CrossRef] [PubMed]
  11. J. A. Browne, A. R. D. Pierro, “A row-action alternative to the EM algorithm for maximizing likelihoods in emission tomography,” IEEE Trans. Med. Imaging 15, 687–699 (1996). [CrossRef]
  12. A. R. D. Pierro, M. E. B. Yamagishi, “Fast EM-like methods for maximum ‘a posteriori’ estimates in emission tomography,” IEEE Trans. Med. Imaging 20, 280–288 (2001). [CrossRef] [PubMed]
  13. J. A. Fessler, H. Erdoğan, “A paraboloidal surrogates algorithm for convergent penalized-likelihood emission image reconstruction,” in Proceedings of the IEEE Nuclear Science Symposium and Medical Imaging Conference (Institute of Electrical and Electronics Engineers, New York, 1998), pp. 1132–1135.
  14. H. Erdoğan, J. A. Fessler, “Monotonic algorithms for transmission tomography,” IEEE Trans. Med. Imaging 18, 801–814 (1999). [CrossRef] [PubMed]
  15. S. Ahn, J. A. Fessler, “Globally convergent image reconstruction for emission tomography using relaxed ordered subsets algorithms,” IEEE Trans. Med. Imaging (to be published).
  16. S. Ahn, J. A. Fessler, “Globally convergent ordered subsets algorithms: application to tomography,” in Proceedings of the IEEE Nuclear Science Symposium and Medical Imaging Conference (Institute of Electrical and Electronics Engineers, New York, 2001), pp. 1064–1068.
  17. H. Erdoğan, J. A. Fessler, “Ordered subsets algorithm for transmission tomography,” Phys. Med. Biol. 44, 2835–2851 (1999). [CrossRef]
  18. S. Sotthivirat, J. A. Fessler, “Relaxed ordered subsets algorithm for image restoration of confocal microscopy,” in Proceedings of the IEEE International Symposium on Biomedical Imaging (Institute of Electrical and Electronics Engineers, New York, 2002), pp. 1051–1054.
  19. M. Bertero, P. Boccacci, “Application of the OS-EM method to the restoration of LBT images,” Astron. Astrophys. Suppl. Ser. 144, 181–186 (2000). [CrossRef]
  20. D. P. Bertsekas, “A new class of incremental gradient methods for least squares problems,” SIAM J. Optim. 7, 913–926 (1997). [CrossRef]
  21. D. L. Snyder, A. M. Hammoud, R. L. White, “Image recovery from data acquired with a charge-coupled-device camera,” J. Opt. Soc. Am. A 10, 1014–1023 (1993). [CrossRef] [PubMed]
  22. D. L. Snyder, C. W. Helstrom, A. D. Lanterman, M. Faisal, R. L. White, “Compensation for readout noise in CCD images,” J. Opt. Soc. Am. A 12, 272–283 (1995). [CrossRef]
  23. P. J. Huber, Robust Statistics (Wiley, New York, 1981).
  24. J. A. Fessler, “Grouped coordinate descent algorithms for robust edge-preserving image restoration,” in Image Reconstruction and Restoration II, T. J. Schulz, ed., Proc. SPIE3170, 184–194 (1997). [CrossRef]
  25. S. Sotthivirat, J. A. Fessler, “Image recovery using partitioned-separable paraboloidal surrogate coordinate ascent algorithms,” IEEE Trans. Image Process. 11, 159–173 (2002).
  26. T. J. Holmes, “Blind deconvolution of quantum-limited incoherent imagery: maximum-likelihood approach,” J. Opt. Soc. Am. A 9, 1052–1061 (1992). [CrossRef] [PubMed]
  27. E. Thiébaut, J.-M. Conan, “Strict a priori constraints for maximum-likelihood blind deconvolution,” J. Opt. Soc. Am. A 12, 485–492 (1995). [CrossRef]
  28. J. Markham, J. A. Conchello, “Parametric blind deconvolution: a robust method for the simultaneous estimation of image and blur,” J. Opt. Soc. Am. A 16, 2377–2391 (1999). [CrossRef]
  29. E. Y. Lam, J. W. Goodman, “Iterative statistical approach to blind image deconvolution,” J. Opt. Soc. Am. A 17, 1177–1184 (2000). [CrossRef]
  30. J. C. D. de Melo, “Partial FFT Evaluation,” in International Conference on Signal Processing Application and Technology (1996), Vol. 1, pp. 134–141, available at http://www.icspat.com/papers/234amfi.pdf .
  31. S. K. Mitra, Digital Signal Processing: A Computer-Based Approach, 2nd ed. (McGraw-Hill, New York, 2001).
  32. The XCOSM deconvolution package (online). Available at http://3dmicroscopy.wustl.edu/∼xcosm/ .
  33. K. Lange, “Convergence of EM image reconstruction algorithms with Gibbs smoothing,” IEEE Trans. Med. Imaging 9, 439–446 (1990). [CrossRef] [PubMed]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited