Share Email Print
cover

Proceedings Paper

Fast Huber-Markov edge-preserving image restoration
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In general, image restoration problems are ill posed and need to be regularized. For applications such as realtime video, fast restorations are also needed to keep up with the frame rate. Restoration based on 2D FFT's provides a fast implementation assuming a constant regularization term over the image. Unfortunately, this assumption creates significant ringing artifacts on edges as well as blurrier edges in the restored image. On the other hand, shift-variant regularization will reduce edge artifacts and provide better quality but it destroys the structure that makes use of the 2D FFT possible, thus no longer have the computational efficiency of the FFT. In this paper, we use a Bayesian approach-maximum a posteriori (MAP) estimation to compute an estimate of the original image given the blurred image. To avoid the smoothing of edges, shift-variant regularization must be used. The Huber-Markov random field model is applied to preserve the discontinuities on edges. For fast minimization of the above model, a new algorithm involving the Sherman-Morrison matrix inversion lemma is proposed. This results in a restored image with good edge preservation and less computation. Experiments show restored images with sharper edges. Convergence is fast, and the computational speed can be improved considerably by breaking the image into subimages.

Paper Details

Date Published: 11 March 2005
PDF: 9 pages
Proc. SPIE 5674, Computational Imaging III, (11 March 2005); doi: 10.1117/12.587823
Show Author Affiliations
Ruimin Pan, Auburn Univ. (United States)
Stanley J. Reeves, Auburn Univ. (United States)


Published in SPIE Proceedings Vol. 5674:
Computational Imaging III
Charles A. Bouman; Eric L. Miller, Editor(s)

© SPIE. Terms of Use
Back to Top