Patch-Based Inpainting for Object Removal and Region Filling in Images

Abstract A large number of articles have been devoted to the application of “texture synthesis” for large regions and “inpainting” algorithms for small cracks in an image. A new approach that allows the simultaneous filling in of different structures and textures is discussed in this present study. The combination of structure inpainting and patch-based texture synthesis carried out (termed as “patch-based inpainting”) for filling and updating the target region shows additional advantages over earlier approaches. The algorithm discussed here uses the patch-based inpainting with isophote-driven patch-based texture synthesis at the core. In this algorithm, once the user selects the regions to be restored, the algorithm automatically searches and fills in these regions with the best matching information surrounding them. We have assigned high priorities to the pixels on the boundary and the structure by computing data terms D ( p ), and the texture and corners are prioritized by computing the confidence C ( p ) of the pixel. We also regularized and weighted the confidence of the pixels, RC ( p ), to achieve a balance of the two. The patch search area near the pixel patch to be filled is bounded for algorithm speed improvement. Patch-based filling significantly improve execution speed compared with pixel-based filling. Filling in is done in such a way that the structure information arriving at the region boundaries is propagated inside. A number of examples on real and synthetic images are used to demonstrate the effectiveness of the algorithm. Robustness with respect to the shape of the selected target region is also demonstrated.