11 March 2005 Fast Huber-Markov edge-preserving image restoration
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ruimin Pan, Ruimin Pan, Stanley J. Reeves, Stanley J. Reeves, "Fast Huber-Markov edge-preserving image restoration", Proc. SPIE 5674, Computational Imaging III, (11 March 2005); doi: 10.1117/12.587823; https://doi.org/10.1117/12.587823
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT


Back to Top