检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高晨舒 翟锐 薛健 吕科 Chenshu Gao;Rui Zhai;Jian Xue;Ke Lv(School of Engineering Science, University of Chinese Academy of Sciences, Beijing)
机构地区:[1]中国科学院大学工程科学学院,北京
出 处:《图像与信号处理》2017年第3期139-146,共8页Journal of Image and Signal Processing
基 金:国家自然科学基金资助项目(U1301251,61271435,61671426,61471150);北京市自然科学基金重点项目(4141003)。
摘 要:当前国内晶圆自动划切的工业应用中,主要采用基于灰度的模板匹配方法,但其计算量大、划切效率较低。本文提出一种改进的基于几何边缘的模板匹配算法,通过Canny边缘检测生成合适的边缘模板,计算模板边缘曲线的梯度方向作为匹配信息进行相似度计算,采用相似度阈值判断优化搜索策略,然后在图像金字塔最顶层进行粗遍历匹配获得潜在匹配目标,逐层匹配直到最底层,以达到对传统的几何模版匹配算法进行加速的目的。实验表明,该方法具有较高的鲁棒性,对于目标均匀或非均匀变化的光照、部分遮挡的情况可以得到良好的匹配效果,而且算法在保证精度的同时可以满足实时性要求,适用于晶圆图像自动划切的工业应用。Nowadays the domestic industrial applications of wafer automatic slicing mainly adopt gray-based template matching method. However, its calculation is quite time-consuming with low slicing efficiency. This paper proposes an improved template matching algorithm based on geometric edge to achieve the goal of accelerating the traditional algorithm. It generates appropriate edge template by Canny edge detection;calculates the gradient direction of template edge curve, which is used to calculate similarity as matching information;optimizes the searching strategy by using the similarity threshold determination. Then, the rough traversal matching is implemented at the top layer of the image pyramid and the matching process continues layer by layer until the bottom. The result of experiment shows that the algorithm proposed in this paper performs high robustness, which can obtain good matching result under different conditions of objectives, including uniform or non-uniform illumination and partial occlusion. Besides, it meets the real-time requirement while the accuracy is ensured, which can be applied to practical industry of automatic wafer image slicing.
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117