一种基于“弦”的边界跟踪算法  

A Boundary Tracking Algorithm Based on Chords

作　　者：刘兆财 王东兴[1] 田洪志 林建钢 LIU Zhao-cai;WANG Dong-xing;TIAN Hong-zhi;LIN Jian-gang(School of Electromechanical and Automotive Engineering,Yantai University,Yantai 264005,China)

机构地区：[1]烟台大学机电汽车工程学院,山东烟台264005

出　　处：《烟台大学学报（自然科学与工程版）》2022年第1期94-100,共7页Journal of Yantai University(Natural Science and Engineering Edition)

摘　　要：针对传统边界跟踪算法搜索范围较大、判断次数较多这一状况,在分析了游程编码方法的基础上提出了一种基于“弦”的边界跟踪算法。该算法以弦为搜索单位,不需要扫描所有边界点的八邻域。并且该算法在基于游程编码的连通域标记后可以直接进行轮廓提取,避免了传统边界跟踪算法在连通域标记后要先将连通域转换为光栅图像形式再提取轮廓的方式。实验结果表明,该算法相较于传统的边界跟踪算法,效率有了显著的提升。Traditional boundary tracking algorithms have large search range,and need many judgment times.A boundary tracking algorithm based on chords is proposed by analysing the run-length coding method,which does not need scanning the eight neighborhoods of all boundary pixels,and whose searching unit is a chord.In addition,the proposed algorithm can be performed directly after connected component labeling based on run-length encoding.In contract,traditional boundary tracking algorithms can only be performed to raster images,which need to be converted previously.Experimental results show that the efficiency of the proposed algorithm is obviously higher than that of traditional boundary tracking algorithms.

关 键 词：连通域标记 边界跟踪 游程编码 目标轮廓 

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