Using intensity edges to improve parameter estimation in blind image restoration

In blind image restoration the parameters of the imaging system are unknown, and must be estimated along with the restored image. Assuming that the images are piecewise smooth, the most part of the information needed for the estimation of the degradation parameters is expected to be located across the discontinuity and hence a better estimation of the paper we adopt a fully Bayesian approach which enables the joint MAP estimation of the image field and the ML estimations of the degradation parameters and the MRF hyperparameters. Owing to the presence of an explicit, binary line process, we exploit suitable approximations to greatly reduce the computational cost of the method. In particular, we employ a mixed-annealing algorithm for the estimation of the intensity and the line fields, periodically interrupted for updating the degradation parameters and the hyperparameters, based on the current estimate of the image field. The degradation parameters are updated by solving a least square problem of very small size. To update the hyperparameters we exploit MCMC techniques and saddle point approximations to reduce the computation of expectations to low cost time averages over binary variables only.

[1]  Reginald L. Lagendijk,et al.  Identification and restoration of noisy blurred images using the expectation-maximization algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

[2]  E. Salerno,et al.  Models and Algorithms for Edge-Preserving Image Reconstruction , 1996 .

[3]  J. C. Dainty,et al.  Iterative blind deconvolution method and its applications , 1988 .

[4]  Aggelos K. Katsaggelos,et al.  Maximum likelihood blur identification and image restoration using the EM algorithm , 1991, IEEE Trans. Signal Process..

[5]  J. Besag On the Statistical Analysis of Dirty Pictures , 1986 .

[6]  Tomaso Poggio,et al.  Probabilistic Solution of Ill-Posed Problems in Computational Vision , 1987 .

[7]  Nikolas P. Galatsanos,et al.  Projection-based blind deconvolution , 1994 .

[8]  Josiane Zerubia,et al.  Maximum Likelihood Estimation of Markov Random Field Parameters Using Markov Chain Monte Carlo Algorithms , 1997, EMMCVPR.

[9]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[10]  Richard G. Lane,et al.  Blind deconvolution of noisy complex-valued image , 1989 .

[11]  Jun Zhang,et al.  The mean field theory in EM procedures for blind Markov random field image restoration , 1993, IEEE Trans. Image Process..

[12]  B. C. McCallum Blind deconvolution by simulated annealing , 1990 .

[13]  Sridhar Lakshmanan,et al.  Simultaneous Parameter Estimation and Segmentation of Gibbs Random Fields Using Simulated Annealing , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Mostafa Kaveh,et al.  A regularization approach to joint blur identification and image restoration , 1996, IEEE Trans. Image Process..

[15]  G. B. Smith,et al.  Preface to S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images” , 1987 .

[16]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[17]  Anna Tonazzini,et al.  A Deterministic Algorithm for Reconstructing Images with Interacting Discontinuities , 1994, CVGIP Graph. Model. Image Process..

[18]  A. Murat Tekalp,et al.  Maximum likelihood image and blur identification: a unifying , 1990 .

[19]  Anna Tonazzini,et al.  Image restoration preserving discontinuities: the Bayesian approach and neural networks , 1992, Image Vis. Comput..

[20]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.