Efficient image completion method based on alternating direction theory

This paper introduces a novel, efficient and accurate algorithm for solving the image completion problem, which is a widely discussed topic in recent years. This algorithm is inspired by recent progress in the matrix completion field. Firstly, corresponding to the RGB channels, an input incomplete image is treated as three incomplete matrices. Then each matrix is recovered by solving a convex relaxation problem using the nuclear norm. In this process, an alternating direction method (ADM) is employed, which is quite easily implementable and able to achieve an optimal solution for the problem efficiently. The experiments show that our methodology is fast and effective and the proposed algorithm is able to handle various applications, such as image restoration, object removal and image denoising.