首页 | 官方网站   微博 | 高级检索  
     

基于随机匹配的非局部相似块搜索算法
引用本文:余文森,吴薇.基于随机匹配的非局部相似块搜索算法[J].计算机系统应用,2016,25(3):209-213.
作者姓名:余文森  吴薇
作者单位:武夷学院 数学与计算机学院, 武夷山 354300,武夷学院 数学与计算机学院, 武夷山 354300
基金项目:国家自然科学基金(60802013);福建省自然科学基金(2015J01669);福建省省属高校专项(JK2014054);福建省中青年教师教育科研项目(JB14103)
摘    要:针对非局部相似块搜索问题,提出一个基于随机匹配的k近邻块匹配算法.在基于Jump Flooding传播的块匹配算法基础上,改进其候选参考块的产生方式,增加从查询块的局部邻域中随机产生候选参考块这一方式.这一改进提高了候选参考块匹配的可能性,进而提高了算法的匹配精确度.实验结果表明改进算法在时间效率和并行性上,与原算法相差不大,但在匹配精确度上,要优于原算法.

关 键 词:随机匹配  非局部相似块搜索  k近邻块匹配  非局部自相似性  局部自相似性
收稿时间:2015/7/24 0:00:00
修稿时间:2015/10/8 0:00:00

Non-Local Similar Patch Search Algorithm Based on Random Match
YU Wen-Sen and WU Wei.Non-Local Similar Patch Search Algorithm Based on Random Match[J].Computer Systems& Applications,2016,25(3):209-213.
Authors:YU Wen-Sen and WU Wei
Affiliation:College of Mathematics and Computer Science, Wuyi University, Wuyishan 354300, China and College of Mathematics and Computer Science, Wuyi University, Wuyishan 354300, China
Abstract:A k nearest neighbor patch match algorithm based on random match was proposed to solve the non-local similar patch search problem, which is an improvement of the patch match algorithm based on jump flooding. On the basis of the origin algorithm, the improved algorithm proposed an additional way to randomly generate candidate reference patch from the local neighborhood of each query patch, which raises the possibility of matching candidate patch to query patch and improves the matching accuracy. Experimental results show that the improved algorithm is comparable with the origin algorithm in time efficiency and parallelism, and outperforms the origin algorithm in matching accuracy.
Keywords:random match  non-local similar patch search  k nearest neighbor patch match  non-local self-similarity  local self-similarity
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号