By Topic

Some new heuristics for thinning binary handprinted characters for OCR

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
$33 $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)
F. W. M. Stentiford ; British Telecom., Ipswich, UK ; R. G. Mortimer

A standard thinning algorithm which consists of a matrix matching scheme used in conjunction with a connectivity measure is briefly described. Several new heuristics are introduced to obviate some of the common shortcomings of thinning algorithms when applied to handprinted data.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-13 ,  Issue: 1 )