检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京联合大学,北京102200
出 处:《计算机工程与应用》2014年第18期167-170,共4页Computer Engineering and Applications
基 金:北京高等学校青年英才计划项目(No.YETP1766)
摘 要:针对Criminisi算法难以获得理想的修复效果,且存在修复时间过长等缺陷,提出一种改进Criminisi算法的图像修复算法。改进优先权计算方式找到最优待修复块,完善最优匹配块搜索策略,找到最优匹配块,采用新的置信值更新方式以获得更为理想修复效果,通过仿真实验测试算法性能,结果表明,相较于Criminisi算法,改进Criminisi算法不仅获得了较理想的图像修复效果,而且大幅度减少了修复时间,提高了图像修复的效果。A novel image inpainting method based on improved Criminisi algorithm to solve the defects of Criminisi algo-rithm which hardly yields unfavorable results and costs much inpainting time is proposed. The priority levels of the blocks are obtained and the optimal inpainted block is selected, and then the optimum matching block in the image is found by improving search method, and the confidence value is updated to obtain good inpainting results. The simulation experi-ments are carried out to test the performance. The experimental results show that compared with Criminisi algorithm, the proposed algorithm is effective in both guaranteeing the quality of repaired images and saving much more repairing time.
关 键 词:图像修复 Criminisi算法 优先级 图像纹理
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.149