一种改进的骨架曲线串行多边形近似算法  

An Improved Sequential Polygonal Approximation Algorithm on Skeleton Curves

作　　者：吕哲[1] 王福利[1,2] 常玉清[1,2] 刘阳[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004 [2]东北大学流程工业综合自动化教育部重点实验室,沈阳110004

出　　处：《自动化学报》2008年第12期1467-1474,共8页Acta Automatica Sinica

基　　金：国家重点基础研究发展计划(973计划)(2002CB312201);国家自然科学基金(60374003)资助~~

摘　　要：常见骨架提取算法对复杂多变的目标边缘具有较强的敏感性,提取出的骨架曲线结构相对复杂,数据量仍然较大.针对这一问题,提出了一种新的骨架曲线多边形近似算法.该算法结合骨架曲线的特点,在传统串行多边形近似算法的基础上引入了平滑度保持、结构特征保持以及拓扑特征保持等约束条件,既较好地保留了原始骨架的主要拓扑结构特征,又有效地简化了骨架曲线的结构,进一步压缩了数据.仿真研究证明了该方法的有效性.High sensitivity of most skeletonization algorithms to the variable edge features makes the structure of the extracted skeletons relatively complicated and the corresponding data excessive. To solve this problem, a novel skeleton polygonal approximation algorithm is proposed. Several impactful improvements such as smoothness-preservation, structure-preservation, and topo-preservation have been proposed to characterize the main structure of the original skeleton as well as predigest other trivial structure for compression of redundant information. The new algorithm is thus superior to the conventional one. Simulation tests have verified the effectiveness of the algorithm.

关 键 词：骨架 多边形近似 形状分析 

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