Superresolution is the process of combining information from multiple subpixel-shifted low-resolution images to form a high-resolution image. It works quite well under ideal conditions but deteriorates rapidly with inaccuracies in motion estimates. We model the original high-resolution image as a Markov random field (MRF) with a discontinuity adaptive regularizer. Given the low-resolution observations, an estimate of the superresolved image is obtained by using the iterated conditional modes (ICM) algorithm, which maximizes the local posterior conditional probability sequentially. The proposed method not only preserves edges but also lends robustness to errors in the estimates of motion and blur parameters. We derive theoretically the neighborhood structure for the posterior distribution in the presence of warping, blurring, and downsampling operations and use this to effectively reduce the overall computations. Results are given on synthetic as well as real data to validate our method.
© 2007 Optical Society of America
Original Manuscript: May 5, 2006
Revised Manuscript: August 14, 2006
Manuscript Accepted: October 9, 2006
Published: March 14, 2007
Vol. 2, Iss. 5 Virtual Journal for Biomedical Optics
Kaggere V. Suresh and Ambasamudram N. Rajagopalan, "Robust and computationally efficient superresolution algorithm," J. Opt. Soc. Am. A 24, 984-992 (2007)