Extraction of strokes in handwritten characters

作者:

Highlights:

摘要

Among the many handwritten character recognition algorithms that have been proposed in the past few years, few of them use models which are able to simulate handwriting. This can be explained by the fact that simulation models require the estimation of strokes starting from statistic images of letters, while crossing and overlapping strokes make this estimation difficult. The approach we suggest is to efficiently deal with crossing areas and overlaps using parametric representations of lines and thickness of stroke: a probabilistic model of strokes is described to extract non-overlapping strokes of the image. A bayesian approach using a statistical study and a model of stroke crossing is described that optimizes the reconstruction of crossings and permits to characterize image of letters by robust graphs of curves.

论文关键词:Handwritten character recognition,Thinning algorithms,Graphs of strokes,Stroke crossing,Stroke path detection

论文评审过程:Received 26 August 1998, Revised 6 April 1999, Accepted 6 April 1999, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(99)00103-X