Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
Substructure Shape Analysis for Kanji Character Recognition
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Polygon Partition into Stable Regions
Proceedings of the 24th DAGM Symposium on Pattern Recognition
| Hi-index | 0.14 |
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. Experiments are explained to show the behavior of the new concept on real images as compared to previous algorithms.