计算机科学与探索2017，Vol.11Issue(7)：1150-1158,9.DOI:10.3778/j.issn.1673-9418.1604052
基于马尔科夫随机场匹配准则的Criminisi修复算法
Criminisi Digital Inpainting Algorithm Based on Markov Random Field Matching Criterion
摘要
Abstract
The accuracy of traditional image exemplar-inpainting algorithm is lower. This paper proposes a new Cri-minisi digital inpainting algorithm based on Markov random field (MRF) matching criterion. The MRF becomes new matching criterion instead of Euclidean distance. Before searching the best matching patch, the image texture model based on MRF is built. Then the global energy of the image is calculated to estimate the value of inpainting patch. Finally, the best matching patch is searched in order to achieve the global optimum. The experimental results show that the proposed algorithm achieves impressive inpainted results, the texture error matching rate is decreased, and the inpainting accuracy is improved.关键词
Criminisi/马尔科夫随机场(MRF)/匹配准则/图像修复Key words
Criminisi/Markov random field (MRF)/matching criterion/image inpainting分类
信息技术与安全科学引用本文复制引用
赵娜,王慧琴,吴萌..基于马尔科夫随机场匹配准则的Criminisi修复算法[J].计算机科学与探索,2017,11(7):1150-1158,9.基金项目
The Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry of China under Grant No. K05055 (教育部留学回国人员科研启动基金) （教育部留学回国人员科研启动基金）
the Natural Science Basic Research Plan of Shaanxi Province under Grant No. 2016JM6079 (陕西省自然科学基础研究计划项目) （陕西省自然科学基础研究计划项目）
the Science and Technology Project of Beilin District in 2016 under Grant No. GX1605 (2016年碑林区科技计划项目). （2016年碑林区科技计划项目）
