基于随机匹配的非局部相似块搜索算法  

Non-Local Similar Patch Search Algorithm Based on Random Match

作　　者：余文森[1] 吴薇[1] 

机构地区：[1]武夷学院数学与计算机学院,武夷山354300

出　　处：《计算机系统应用》2016年第3期209-213,共5页Computer Systems & Applications

基　　金：国家自然科学基金(60802013);福建省自然科学基金(2015J01669);福建省省属高校专项(JK2014054);福建省中青年教师教育科研项目(JB14103)

摘　　要：针对非局部相似块搜索问题,提出一个基于随机匹配的k近邻块匹配算法.在基于Jump Flooding传播的块匹配算法基础上,改进其候选参考块的产生方式,增加从查询块的局部邻域中随机产生候选参考块这一方式.这一改进提高了候选参考块匹配的可能性,进而提高了算法的匹配精确度.实验结果表明改进算法在时间效率和并行性上,与原算法相差不大,但在匹配精确度上,要优于原算法.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.

关 键 词：随机匹配 非局部相似块搜索 k近邻块匹配 非局部自相似性 局部自相似性 

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