頁籤選單縮合
題 名 | Optimal Line Segment Extraction Algorithms for Online Chinese Character Recognition Using Dynamic Programming |
---|---|
作 者 | 曾建誠; | 書刊名 | 華夏學報 |
卷 期 | 32 1997.10[民86.10] |
頁 次 | 頁13177-13187 |
分類號 | 312.74 |
關鍵詞 | |
語 文 | 英文(English) |
英文摘要 | 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 of fit the cursive stroke of character within the prescribed error bound. Three error measure 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. |
本系統中英文摘要資訊取自各篇刊載內容。