Fast inpainting algorithm for real-time video inpainting problem
Metadata[+] Show full item record
The paper examines a simple and efficient method to solve the digital inpainting problem with a reasonable result by processing the information locally around the painting area. The method is based on a unique matrix transformation algorithm. It can guarantee transforming a non-negative matrix without rows and columns of all zero elements into another matrix with the same size but having both its column and row products equal to 1. The method is time and memory efficient so it can be used in many real time systems like video stream which may have protential inpainting problems.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.