Restoration of temporal information in off-line arabic handwriting

作者:

Highlights:

摘要

An algorithm is developed in order to restore the temporal information in off-line Arabic handwriting so that on-line recognition algorithms may be used to advantage. Firstly, the secondary strokes that touch the main stroke are segmented and the start and end vertices of the main stroke are determined. Secondly, the subword is traversed from the start vertex to the end vertex by solving the Chinese postman's problem for the subword graph. Special rules are applied in order to restore the temporal information in the subword and to obtain a traversal consistent with Arabic handwriting. A subword representation is suggested such that the subword features are implied and can be easily extracted. A total of 1605 strokes, freely written by two writers, are used to test the algorithms and a high rate of restoration of temporal information is obtained.

论文关键词:Arabic handwriting,Temporal information,Chinese postman's problem,Eulerian path

论文评审过程:Received 24 March 1992, Revised 9 December 1992, Accepted 20 January 1993, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(93)90002-E