Premium
Non‐Local Image Inpainting Using Low‐Rank Matrix Completion
Author(s) -
Li Wei,
Zhao Lei,
Lin Zhijie,
Xu Duanqing,
Lu Dongming
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12521
Subject(s) - inpainting , computer science , rendering (computer graphics) , matrix completion , artificial intelligence , image (mathematics) , rank (graph theory) , computer vision , pixel , matrix (chemical analysis) , low rank approximation , algorithm , pattern recognition (psychology) , mathematics , mathematical analysis , physics , materials science , composite material , quantum mechanics , combinatorics , hankel matrix , gaussian
In this paper, we propose a highly accurate inpainting algorithm which reconstructs an image from a fraction of its pixels. Our algorithm is inspired by the recent progress of non‐local image processing techniques following the idea of ‘grouping and collaborative filtering’. In our framework, we first match and group similar patches in the input image, and then convert the problem of estimating missing values for the stack of matched patches to the problem of low‐rank matrix completion, and finally obtain the result by synthesizing all the restored patches. In our algorithm, how to accurately perform patch matching process and solve the low‐rank matrix completion problem are key points. For the first problem, we propose a robust patch matching approach, and for the second task, the alternating direction method of multipliers is employed. Experiments show that our algorithm has superior advantages over existing inpainting techniques. Besides, our algorithm can be easily extended to handle practical applications including rendering acceleration, photo restoration and object removal .