一种新的边界跟踪算法  

A New Algorothm for Boundary Tracing

作　　者：石爽[1] 曲仕茹[1] 何力[1] 

机构地区：[1]西北工业大学自动化学院,陕西西安710072

出　　处：《工程图学学报》2011年第3期52-56,共5页Journal of Engineering Graphics

基　　金：陕西省工业攻关资助项目(2008KD7-14)

摘　　要：针对提取的图像边缘中存在非单像素和断点的情况,提出了双层边界区域生长的边界跟踪算法。通过对中心点周围里层点和外层点分别进行搜索,然后把里层点和上一层中心点的外层点合并,并将并集中的点分别作为下一步搜索的中心点,循环向下搜索。同时充分考虑了起始中心点单向搜索的情况,并在一次搜索过程中完成了对断点的补齐工作,从而弥补了"记忆爬虫"法和八邻域法在跟踪分支、断点和"厚"边缘过程中存在的不足。实验证明该方法效果较好。For the shortcoming of non-single pixels and broken points in the obtained image boundary,a new algorithm for boundary tracing of dual layer boundary region growing is proposed,to search inner-points and outer-points around center-points,to combine the inner-points with upper outer-points,to conduct continuous tracing with the combined points as the center-points in next search.The algorithm takes into account the one-way search from initial points,and can fill the broken points in one tracing process.Thus,it effectively makes up the defects of memory reptile method and eight neighborhood method in tracing embranchment,broken point and thick boundary.The experiments prove its effectiveness.

关 键 词：区域生长 边界跟踪 爬虫 八邻域 

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