计算机应用与软件Issue(10)：206-208,223,4.DOI:10.3969/j.issn.1000-386x.2014.10.049
基于局部平均灰度熵的快速图像修复算法
A FAST IMAGE INPAINTING SCHEME USING LOCAL AVERAGE GRAY ENTROPY
摘要
Abstract
The operation time of sample-based image inpainting algorithms using block collage mainly depends on execution efficiency of the best sample blocks matching procedure.Currently these algorithms commonly adopt global search to obtain sample blocks for similarity comparison with the blocks to be inpainted one by one,and the range size of the sampling region has great influence on the inpainting quality and efficiency.For improving computation efficiency,we propose a novel image inpainting algorithm which is based on local average gray entropy,in iteration it determines adaptively the size of sampling region according to the average gray entropy of the neighbouring window of the block to be inpainted every time.Experimental results show that the proposed algorithm improves the inpainting quality compared with classic Criminisi inpainting algorithm,besides,it also greatly raises the inpainting efficiency.关键词
图像修复/图像补全/纹理合成/局部平均灰度熵Key words
Image inpainting/Image completion/Texture synthesis/Local average gray entropy分类
信息技术与安全科学引用本文复制引用
张晴,林家骏,刘云翔..基于局部平均灰度熵的快速图像修复算法[J].计算机应用与软件,2014,(10):206-208,223,4.基金项目
国家自然科学基金项目（60903186，61401281）；上海市自然科学基金（14ZR1440700）；上海市高校青年教师培养资助计划（ZZyyy13022）；上海应用技术学院引进人才基金（YJ2013-10）。 （）
