Parallelizations of an Inpainting Algorithm Based on Convex Feasibility

Abstract

Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.