A Rank Minimization Approach to Video Inpainting

This paper addresses the problem of video inpainting, that is seamlessly reconstructing missing portions in a set of video frames. We propose to solve this problem proceeding as follows: (i) finding a set of descriptors that encapsulate the information necessary to reconstruct a frame, (ii) finding an optimal estimate of the value of these descriptors for the missing/corrupted frames, and (iii) using the estimated values to reconstruct the frames. The main result of the paper shows that the optimal descriptor estimates can be efficiently obtained by minimizing the rank of a matrix directly constructed from the available data, leading to a simple, computationally attractive, dynamic inpainting algorithm that optimizes the use of spatio/temporal information. Moreover, contrary to most currently available techniques, the method can handle non?periodic target motions, non?stationary backgrounds and moving cameras. These results are illustrated with several examples, including reconstructi...

• Type: Conference
• Year: 2007
• Where: ICCV
• Authors: Tao Ding, Mario Sznaier, Octavia I. Camps
• Keywords: Computer Vision, Dynamic Inpainting Algorithm, ICCV 2007, Non Periodic Target Motions, Optimal Descriptor Estimates, Optimal Estimate, Video Inpainting