Cart (Loading....) | Create Account
Close category search window
 

Segmentation of handwritten numerals by graph representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Suwa, M. ; Fujitsu Labs. Ltd., Kawasaki, Japan ; Naoi, S.

A new algorithm is proposed for segmenting simply and multiply connected digits. It also removes ligatures. After thinning the pattern, the edges and vertices are extracted and the pattern is represented as a connected graph. Then the matrices relating to the graph are calculated. To determine the segmentation path, both graph theory techniques and heuristic rules are used. The boundaries of digits are calculated to make the width of touching strokes uniform. The separated digits thus have a more natural shape than can be achieved using algorithms that split patterns using straight lines or line segments.

Published in:

Frontiers in Handwriting Recognition, 2004. IWFHR-9 2004. Ninth International Workshop on

Date of Conference:

26-29 Oct. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.