An algorithm of Total Variation for Image Inpainting

Inpainting, the technique of modifying an image in an undetectable form, is as ancient as art itself. Inpainting is an image interpolation problem with broad applications in image and vision analysis. Digital inpainting is related to automatic filling-in of user-selected regions in digital images. It consider the problem of filling in missing or damaged wavelet coefficients due to lossy image transmission or communication. The task is closely related to classical inpainting problems, but also remarkably differs in that the inpainting regions are in the wavelet domain. New challenges include that the resulting inpainting regions in the pixel domain are usually not well defined, as well as that degradation is often spatially inhomogeneous. An extensive survey of previous work related to the digital inpainting is presented to fill in the gap and a new algorithm using a variational approach to formulate the reconstruction problem which is motivated by the quality of results, easier implementation, efficiency, and effectiveness is presented. The associated EulerLagrange equations lead to nonlinear partial differential equations (PDE's) in the wavelet domain. Implemented method can be viewed as a method for solving Total-Variation(TV) minimization problems using fast optimization technique which is very efficient calculate an optimal solution for image inpainting in wavelet domain. The restored images obtained with this algorithm look plausible in general and surprisingly good in some cases. In addition, it is also having edge over other algorithms in terms of computation time and image quality while filling-in large region. Smitha Raveendran Department of Electronics RAIT, Nerul Navi Mumbai smitha2805@gmail.com isophote lines arriving at the regions boundaries are completed inside.