Digital inpainting methods provide an important tool in the restoration of images in a wide range of applications. We present mathematical methods with certain higher order partial differential equations for the inpainting of ancient frescoes. In particular we discuss the Cahn-Hilliard equation for the inpainting of binary structure and a higher order total variation approach. As an example for...

Given an image and a region Ω inside it, the inpainting problem consists in modifying the image values of the pixels in Ω so that this region does not stand out with respect to its surroundings. The purpose of inpainting might be to restore damaged portions of an image (e.g. an old photograph where folds and scratches have left image gaps) or to remove unwanted elements present in the image (e....

In many imaging applications, there exists potential for corruption of the images by sources of structured noise that completely loses original pixel information. The reconstruction of the original image from its corrupted observation is known as image inpainting. This paper seeks to investigate image inpainting using a particular algorithm, the alternating direction method of multipliers (ADMM...

Finding optimal inpainting data plays a key role in the field of image compression with partial differential equations (PDEs). In this paper, we optimise the spatial as well as the tonal data such that an image can be reconstructed with minimised error by means of discrete homogeneous diffusion inpainting. To optimise the spatial distribution of the inpainting data, we apply a probabilistic dat...

The art of recovering an image from damage in an undetectable form is known as inpainting. The manual work of inpainting is most often a very time consuming process. Due to digitalization of this technique, it is automatic and faster. In this paper, after the user selects the regions to be reconstructed, the algorithm automatically reconstruct the lost regions with the help of the information s...

In this article an application of the inpainting algorithm for recovering packet losses from transmitting sequential quad tree compressed images over wireless sensor networks is presented. The aim of the proposed scheme is to reconstruct the missing information at the receiver side, based on the inpainting algorithm, instead of increasing the overhead of the network by requesting from the trans...

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...

Object removal by image inpainting aims at the visual uniformity of the inpainted blanks among their surroundings. Most inpainting algorithms pursue the structure continuity and texture similarity only in color. In this paper we take the view depth continuity into account and propose a depth-guided inpainting algorithm, in which a single color image and its associated disparity map are inpainte...

Digital image inpainting is a technique used for filling in the disappeared or spoiled regions of an image using information from the surrounding area. Image inpainting provides a means to restore damaged region of an image, such that the image looks complete and natural after the inpainting process. Exemplar-based algorithms are a popular technique for image inpainting, in which two important ...

Image Inpainting is the process of filling in missing regions in an image. The objective of inpainting is to reconstruct the missing regions in a visually plausible way. Several algorithms