期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2019
卷号：10
期号：6
页码：423-433
DOI：10.14569/IJACSA.2019.0100655
出版社：Science and Information Society (SAI)
摘要：In patch-based inpainting methods, the order of filling the areas to be restored is very important. This filling order is defined by a priority function that integrates two parameters: confidence term and data term. The priority, as initially defined, is negatively affected by the mutual influence of confidence and data terms. In addition, the rapid decrease to zero of confidence term leads the numerical instability of algorithms. Finally, the data term depends only on the central pixel of the patch, without taking into account the influence of neighboring pixels. Our aim in this paper is to propose an algorithm to solve the problems mentioned above. This algorithm is based on a new definition of the priority function, a calculation of the average data term obtained from the elementary data terms in a patch and an update of the confidence term slowing its decrease and avoiding convergence to zero. We evaluated our method by comparing it with algorithms in the literature. The results show that our method provides better results both visually and in terms of the Peak Signal-to-Noise Ratio (PSNR) and Structural SIMilarity index (SSIM).
关键词：Image inpainting; Criminisi algorithm; priority function; data term; confidence term; identity function
