基于修复顺序的图像修复算法  

Image repair based on repairing sequence

作　　者：张伟彬[1] 

机构地区：[1]信息产业部电信科学技术第一研究所,上海200032

出　　处：《计算机工程与应用》2008年第22期195-196,243,共3页Computer Engineering and Applications

摘　　要：提出一个用于图像修复的算法。首先计算修复前沿每个待修复小片的优先级,然后优先修复具有最高优先级的小片。优先级计算方法能体现每个小片具有的结构信息以及已有颜色的可信度,使得基于小片的纹理综合方法有序进行,同时修复目标区域中的纹理和结构信息。用户选择一个目标区域后,算法就根据选择区域周围的信息自动地修复目标区域。实验证明该算法不仅快速且修复的效果非常好,且目标区域较大时也能达到很好效果。This paper proposes an algorithm for image repair.This algorithm performs the task through a best-first repairing strategy based on the priority assigned to each patch on the repairing front.The priority computation is biased toward those patches with structure information and surrounded by high-confidence pixels,so that the texture synthesis is performed orderly. This algorithm can not only synthesize texture but also structure information.After the object area has been selected by the user, this algorithm will perform repairing totally automatically.Experiment results show that this algorithm is fast and perfect even if the object area is big.

关 键 词：图像修复 纹理综合 纹理 结构 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]