An algorithm that decomposes a line image into singular and regular regions is presented. We define a contour trapezoid as the building block of regular regions, and postulate a Maximal Trapezoid Set as the core of regular regions. Then, we describe an algorithm that calculates a Maximal Trapezoid Set of a polygon and show how to use it to find a skeleton of a polygonal approximation of a contour. Several experiments are explained to show the behavior of the new concept on real images as compared to previous algorithms and criteria.
Index Terms:
Skeleton, Singular-Regular Polygon Decomposition, Trapezoid Covering.
Citation:
Jairo Rocha Rafael Bernardino, "Singularities and Regularities on Line Pictures via Symmetrical Trapezoids," icdar, pp.809, Fourth International Conference Document Analysis and Recognition (ICDAR'97), 1997