Abstract
The paper presents an algorithm for the estimation of skeletons of thick characters. We directly identify the core pixels of the skeleton forming the core skeletal segments based on labeling of the character boundary with some local properties. The core skeletal pixel is defined as the midpoint of a line segment normal to the boundary pixels. These core skeletal segments are extended and joined systematically based on certain global properties resulting in the final skeleton. The algorithm is independent of the width of the character and is capable of yielding a skeleton close to our intuitive notion of character shape. The topological description of the character is constructed more or less as a by-product of the skeletomization process. The description forms the basis for character recognition using syntactic methods. The algorithm is well suited for parallel implementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.