An optimal line segment extraction algorithm for online Chinese character recognition using dynamic programming

摘要

In this paper, a dynamic programming algorithm which can extract the line segments from the loci of Chinese character in running hand or cursive writing is proposed. This algorithm tries to find the minimum line segments to fit the cursive stroke of character within the prescribed error bound. Three error measures are presented to construct a globally optimal approximation to the given stroke, including sum of deviation, peak deviation and length error. Extensive experiments are demonstrated to illustrate the performance of the proposed algorithm.