一种基于矩和支配点检测的多边形拟合算法  

A Moment and Dominant Points-Based Method for Polygonal Approximation

作　　者：谢明鸿[1] 张亚飞[1] 付琨[1] 吴一戎[1] 

机构地区：[1]中国科学院电子学研究所

出　　处：《模式识别与人工智能》2007年第2期219-224,共6页Pattern Recognition and Artificial Intelligence

基　　金：国家863计划资助项目(No.2003AA131152)

摘　　要：提出一种基于几何矩和支配点检测的多边形拟合算法.支配点检测法可以最大范围地保留原始轮廓特征,但拟合后顶点数偏多.而基于几何矩的多边形拟合算法虽然可以将拟合后的顶点数控制在指定范围内,但是却容易使拟合结果陷入局部最优.本文对这两种算法进行关键步骤和参数的改进,并将它们有机结合起来,使得本文算法可以将绝大多数闭合曲线在全局最优的情况下将其拟合成任意顶点数的多边形.A method based on geometric moments and dominant points is proposed. Algorithm for detecting dominant points could keep the original contour feature as much as possible, but the number of remain vertexes is not controllable. On the contrary, the method based on geometric moments can reduce the amount of vertexes to any number, but it makes the fitting result get into local optimum. Thus, a new method is introduced which integrates the two algorithms. In this way, most closed curves can be fitted to polygons with specified number of vertexes in a global optimal way.

关 键 词：多边形拟合 几何矩 支配点 

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