Given an image where a specified region is unknown, image inpainting or image completion is the problem of inferring the image content in this region. Traditional retouching or inpainting is the practice of restoring aged artwork, where damaged or missing portions are repainted based on the surrounding content to approximate the original appearance. In the context of digital images, inpainting ...

Image inpainting is an important area in digital image processing, which has applications in problems like image restoration, scratch removal, or fluorescent microscopy. A lot of tools have been developed to tackle these problems. The total variation inpainting and the Euler’s elastica model are popular variational PDE methods in nontexture local image inpainting. The former is developed from t...

Colonoscopy video frames might be contaminated by bright spots with unsaturated values known as specular reflection. Detection and removal of such reflections could enhance the quality of colonoscopy images and facilitate diagnosis procedure. In this paper we propose a novel two-phase method for this purpose, consisting of detection and removal phases. In the detection phase, we employ both HSV...

In this paper, we propose an algorithm that automatically detects and removes moving logos in video. The proposed algorithm consists of logo detection, tracking and extraction, and removal. In the logo detection step, we automatically detect moving logos using the saliency map and the scale invariant feature transform. In the logo tracking and extraction step, an improved mean shift tracking me...

We propose a total variation based model for simultaneous image inpainting and blind deconvolution. We demonstrate that the tasks are inherently coupled together and that solving them individually will lead to poor results. The main advantages of our model are that (i) boundary conditions for deconvolution required near the interface between observed and occluded regions are naturally generated...

Image inpainting is the filling in of missing or damaged regions of images using information from surrounding areas. We outline here the use of a model for binary inpainting based on the Cahn-Hilliard equation, which allows for fast, efficient inpainting of degraded text, as well as super-resolution of high contrast images.

The efficient compression of depth maps is becoming more and more important. We present a novel codec specifically suited for this task. In the encoding step we segment the image and extract betweenpixel contours. Subsequently we optimise the grey values at carefully selected mask points, including both hexagonal grid locations as well as freely chosen points. We use a chain code to store the c...

Many 3D reconstruction methods produce incomplete depth maps. Depth map inpainting can generate visually plausible structures for the missing areas. We present an inpainting method that encourages at surfaces without favouring fronto-parallel planes. Moreover, it uses a color image to guide the inpainting and align color and depth edges. We implement the algorithm e ciently through graph-cuts. ...