Learning how to inpaint from global image statistics
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 305-312 vol.1
- https://doi.org/10.1109/iccv.2003.1238360
Abstract
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information on images to solve this problem. These algorithms successfully solve the local inpainting problem but they must, by definition, give the same completion to any two holes that have the same boundary, even when the rest of the image is vastly different. We address a different, more global inpainting problem. How can we use the rest of the image in order to learn how to inpaint? We approach this problem from the context of statistical learning. Given a training image we build an exponential family distribution over images that is based on the histograms of local features. We then use this image specific distribution to inpaint the hole by finding the most probable image given the boundary and the distribution. The optimization is done using loopy belief propagation. We show that our method can successfully complete holes while taking into account the specific image statistics. In particular it can give vastly different completions even when the local neighborhoods are identical.Keywords
This publication has 16 references indexed in Scilit:
- Mathematical Models for Local Nontexture InpaintingsSIAM Journal on Applied Mathematics, 2002
- Image quilting for texture synthesis and transferPublished by Association for Computing Machinery (ACM) ,2001
- Orientation, Scale, and Discontinuity as Emergent Properties of Illusory Contour ShapeNeural Computation, 2001
- Filling-in by joint interpolation of vector fields and gray levelsIEEE Transactions on Image Processing, 2001
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphsIEEE Transactions on Information Theory, 2001
- Image inpaintingPublished by Association for Computing Machinery (ACM) ,2000
- Minimax Entropy Principle and Its Application to Texture ModelingNeural Computation, 1997
- Inducing features of random fieldsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
- Multiresolution sampling procedure for analysis and synthesis of texture imagesPublished by Association for Computing Machinery (ACM) ,1997
- Emergence of simple-cell receptive field properties by learning a sparse code for natural imagesNature, 1996