Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Fragment-based image completion
ACM SIGGRAPH 2003 Papers
Image completion with structure propagation
ACM SIGGRAPH 2005 Papers
CAD-CG '05 Proceedings of the Ninth International Conference on Computer Aided Design and Computer Graphics
An Image Inpainting Approach Based on the Poisson Equation
DIAL '06 Proceedings of the Second International Conference on Document Image Analysis for Libraries
Image Repairing: robust image synthesis by adaptive ND tensor voting
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Simultaneous structure and texture image inpainting
IEEE Transactions on Image Processing
Region filling and object removal by exemplar-based image inpainting
IEEE Transactions on Image Processing
Accurate spatio-temporal reconstruction of missing data in dynamic scenes
Pattern Recognition Letters
| Hi-index | 0.00 |
In this paper, we propose an efficient image inpainting algorithm by introducing important aspects and improvements corresponding to the filling order of the pixels in the target region and texture synthesis in a dynamic searching range. The algorithm consists of two parts. The first part decides the filling order of the pixels in the target regions based on the high accuracy fast marching method. The second part of the algorithm implicitly assumes a Markov random field model for textured image regions and computes blocks of texture using an efficient search process and the SSD (Sum of Squared Differences) measure. The algorithm is straightforward to implement and restores the target regions with visually plausible quality that is at par or better than several existing methods, with a lower execution cost.