Polygonal representation of digital planar curves through dominant point detection - a nonparametric algorithm
We describe a new algorithm that detects a set of feature points on the boundary of an 8-connected shape that constitute the vertices of a polygonal approximation of the shape itself. The set of feature points (nodes) is a ranked subset of the original shape points whose connected left and right arm extents cover the entire shape. Nodes are ranked based on their strength (in terms of their importance to other boundary points), length of support region, and distance from the centroid. The polygon obtained by linking the detected nodes approximates the contour in an intuitive way. The proposed algorithm does not require an input parameter and works well for shapes with features of multiple sizes. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
dominant points polygonal approximation curvature digital curve shape representation