A new algorithm for dominant points detection and polygonization of digital curves

被引:77
作者
Marji, M [1 ]
Siy, P [1 ]
机构
[1] Wayne State Univ, Detroit, MI 48202 USA
关键词
corner; curvature; digital curve; dominant points; polygonal approximation; shape representation;
D O I
10.1016/S0031-3203(03)00119-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new algorithm for detecting dominant points and polygonal approximation of digitized closed curves is presented. It uses an optimal criterion for determining the region-of-support of each boundary point, and a new mechanism for selecting the dominant points. The algorithm does not require an input parameter, and can handle shapes that contain features of multiple sizes efficiently. In addition, the approximating polygon preserves the symmetry of the shape. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:2239 / 2251
页数:13
相关论文
共 58 条