Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields

Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov random fields. Its main advantage lies in the use of priority belief propagation and dynamic label pruning to reduce the computational cost of standard belief propagation while producing high quality results. However, one of the drawbacks of the method is its use of a heuristically chosen parameter set. In this paper, a method for automatically determining the parameters for the belief propagation and dynamic label pruning steps is presented. The method is based on an information theoretic approach making use of the entropy of the image patches and the distribution of pairwise node potentials. A number of image completion results are shown demonstrating the effectiveness of our method.

[1]  M.,et al.  Statistical and Structural Approaches to Texture , 2022 .

[2]  William T. Freeman,et al.  Learning low-level vision , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Nikos Komodakis,et al.  Image Completion Using Global Optimization , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[4]  Pedro F. Felzenszwalb,et al.  Efficient belief propagation for early vision , 2004, CVPR 2004.

[5]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[6]  Alexei A. Efros,et al.  Texture synthesis by non-parametric sampling , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[7]  Harry Shum,et al.  Image completion with structure propagation , 2005, ACM Trans. Graph..

[8]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[9]  Eero P. Simoncelli,et al.  A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients , 2000, International Journal of Computer Vision.