检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学信息科学与工程学院,济南250100
出 处:《计算机工程与应用》2014年第8期143-146,共4页Computer Engineering and Applications
摘 要:在Criminisi算法基础上,针对其填充次序不准确等缺点,提出了一种基于样例的图像修复方法。通过在优先权函数中引入相邻像素间颜色差值信息,图像结构部分优先传播。同时,置信度值更新考虑样本填充质量,目标块与相似块差异越小则该值相对较高。另外,块搜索过程中多个样本块有相同最小颜色距离时,选取梯度距离最小的样本块。实验结果表明,改进算法对各类图像取得了较高修复质量。In order to solve the problem of inaccurate filling orders in Criminisi algorithm, an exemplar-based algorithm for image inpainting is proposed. Color variation between neighbor pixels is used to define the priority function and image structures propagate firstly. Besides, quality of exemplar filling is introduced into the update of confidence term. Confi-dence value is relatively high when the difference between the target patch and the similar patch is small. In addition, the patch that with minimum gradient distance is adopted when there are several most similar blocks with a same color dis-tance. Experimental results show that the improved algorithm achieves high inpainting quality on various kinds of images.
关 键 词:图像修复 纹理合成 优先权 梯度距离 置信度项更新
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.136.226