
An Algorithm for Total Variation Inpainting Based on Nonlinear Multi-Grid Methods
Author(s) -
Chen Fei,
Meiqing Wang,
Lai Chen
Publication year - 2008
Publication title -
journal of algorithms and computational technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.234
H-Index - 13
eISSN - 1748-3026
pISSN - 1748-3018
DOI - 10.1260/174830108784300303
Subject(s) - inpainting , image (mathematics) , nonlinear system , domain (mathematical analysis) , algorithm , computer science , artificial intelligence , grid , computer vision , mathematics , geometry , mathematical analysis , physics , quantum mechanics
Image inpainting refers to restoring a damaged image with missing information. The total variation (TV) inpainting model is one such method that simultaneously fills in the regions with available information from their surroundings and eliminates noises. The method works well with small narrow inpainting domains. However there remains an urgent need to develop fast iterative solvers, as the underlying problem sizes are large. In addition one needs to tackle the imbalance of results between inpainting and denoising. When the inpainting regions are thick and large, the procedure of inpainting works quite slowly and usually requires a significant number of iterations and leads inevitably to oversmoothing in the outside of the inpainting domain. To overcome these difficulties, we propose a solution for TV inpainting method based on the nonlinear multi-grid algorithm.