Inpainting is an image interpolation problem, with broad applications in image and vision analysis. This paper presents our recent efforts in developing inpainting models based on the Bayesian and variational principles. We discuss several geometric image models, their role in the construction of variational in-painting models, and the associated Euler-Lagrange PDEs and their numerical computat...

In this paper, we propose a method for image compression in which currently developed vision technologies are incorporated with traditional transform-based coding methods. Based on newly developed vision technologies, we present two coding-oriented inpainting methods: structure-aware inpainting and object-based inpainting. Examples show the effectiveness of these inpainting methods on informati...

Inpainting methods attempt to reconstruct lost or destroyed image information as plausibly and sensibly to the human eye as possible. Information from the neighboring area is extrapolated into unkown image regions. This technique is also employed in view synthesis for 3D videos as well. Warping given scene views to other viewingpoints causes disocclusion artifacts to occur in the synthesized im...

The process of repairing the damaged area or to remove the specific areas in a video is known as video inpainting. To deal with this kind of problems, not only a robust image inpainting algorithm is used, but also a technique of structure generation is used to fill-in the missing parts of a video sequence taken from a static camera. Most of the automatic techniques of video inpainting are compu...

Inpainting refers to the task of filling in missing or damaged regions of an image. In this paper, we are interested in the inpainting problem where the missing regions are so large that local inpainting methods fail. As an alternative to the local principle, we make use of other images with related global information to enable a reasonable inpainting. Our method has roughly three phases: landm...

Digital inpainting provides a means for reconstruction of small damaged portions of an image. Although the inpainting basics are straightforward, most inpainting techniques published in the literature are complex to understand and implement. We present here a new algorithm for digital inpainting based on the fast marching method for level set applications. Our algorithm is very simple to implem...

The JDHC scheme not only focuses on the high hiding capacity and recovery quality, it also integrates the image compression and data hiding into a single module. joint datahiding and compression scheme by using SMVQ and PDE-based image inpainting. Image Inpainting refers to methods which consist with filling-in disappeared regions in a picture. Inpainting for digital images has found applicatio...

In applications like creating immersive walkthrough systems or digital reconstruction of invaluable artwork, both inpainting and super-resolution of the given images are the preliminary steps in order to provide better visual experience. The usual practice is to solve these problems independently in a pipelined manner. In this paper we propose a unified framework to perform simultaneous inpaint...

In this article, we consider the following inpainting problem arising in image restoration: part of an image has been removed, and we want to restore the image from the remaining, possibly noisy, portion. We show that if the true image contains no sharp edges, the inpainting can be done rather satisfactorily by means of an isotropic smoothness prior assumption. If, on the other hand, we have in...