改进的轮廓多边形分段逼近算法  

Improved contour polygon piecewise approximation algorithm

作　　者：宋振一 陈少斌[1] 黄宴委[1] 王会平 SONG Zhenyi;CHEN Shaobin;HUANG Yanwei;WANG Huiping(College of Electrical Engineering and Automation,Fuzhou University,Fuzhou 350116,China;Haifeng Publishing House,Fuzhou 350001,China)

机构地区：[1]福州大学电气工程与自动化学院,福建福州350116 [2]海风出版社,福建福州350001

出　　处：《传感器与微系统》2020年第2期117-119,123,共4页Transducer and Microsystem Technologies

摘　　要：针对数字曲线逼近中逼近结果对尺度变化不具有自适应性以及依赖于起始点的选取的缺陷,提出一种改进的轮廓多边形分段逼近算法。首先计算轮廓尖锐度确定角点,依据角点对轮廓进行分段且作为多边形的逼近起点,减弱了逼近结果对起点的依赖;然后分段对轮廓曲线进行多边形逼近,在分裂合并算法基础上,提出以弧长比值作为停止条件的多边形逼近迭代方法,以提高多边形算法对尺度变化的鲁棒性。实验结果表明:逼近结果对尺度变化有较好的鲁棒性,且对轮廓多边形的特征提取具有一定的意义。Aiming at the problem that the approximation result is not adaptive to the scale change and depends on the selection of the starting point in the digital curve approximation,an improved contour polygon segmentation approximation method is proposed.Firstly,the contour sharpness is calculated to determine the corner point,and the contour is segmented according to the corner point and set it as the starting point of the polygon,which reduces the dependence of the approximation result on the starting point.On the basis of splitting and merging algorithm,a polygon approximation method with the arc length ratio as the threshold is proposed to improve the robustness of the polygon algorithm to scale changes.The experimental results show that the approximation results are robust to scale changes and have certain significance for feature extraction of contour polygons.

关 键 词：多边形逼近 轮廓分段 角点 

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