检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐敏 丁友东[1,2] 于冰 李畅[1,2] 吴彪 张婉莹[1,2] XU Min;DING Youdong;YU Bing;LI Chang;WU Biao;ZHANG Wanying(Shanghai Film Academy,Shanghai University,Shanghai 200072,China;Shanghai Special Effects Engineering Research Center,Shanghai University,Shanghai 200072,China)
机构地区:[1]上海大学上海电影学院,上海200072 [2]上海大学上海电影特效工程技术研究中心,上海200072
出 处:《上海大学学报(自然科学版)》2018年第5期686-693,共8页Journal of Shanghai University:Natural Science Edition
基 金:国家自然科学基金资助项目(61402278);上海市自然科学基金资助项目(14ZR1415800);上海市科委科技攻关资助项目(16511101302);上海市科委工程技术研究中心建设专项资助项目(16DZ2251300)
摘 要:针对传统划痕修复算法存在梯度效应以及精度不高等问题,提出基于5×5邻域像素点相关性的划痕修复算法.利用待修复区域与周围24个邻近像素点的相关性,通过定义待修复像素点的优先度来确定填充顺序.每次修复一个像素点并及时更新待修复区域,重复操作直至待修复区域像素点的个数为0.实验结果证明,该算法与传统算法相比,更适用于旧的影视资料的修复,既可缩短运行时间,也获得了较高的峰值信噪比(peak signal to noise ratio,PSNR)值和结构相似性(structural similarity index, SSIM)值.In view of the existence of gradient effect and low accuracy of traditional scratch repair algorithm,this paper proposes a new scratch repair algorithm based on 5×5 neighborhood pixels correlation,using the correlation between the repaired area and the surrounding 24 adjacent pixels,and determining the filling order by defining the priority of the repaired pixels.Each time a pixel is repaired and the area to be repaired is updated in time as well.This operation is repeated until the number of the pixels in the region to be repaired comes to 0.The experimental results show that compared with other traditional algorithms,the algorithm is more suitable for repairing old film and television materials,which not only shortens the running time,but also obtains higher peak signal to noise ratio(PSNR)and structural similarity index(SSIM)values.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28