| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
An efficient stroke-to-stroke correspondence search algorithm is proposed with application to stroke-order-free online character recognition. An exponential order algorithm complexity is achieved by u...sing Dynamic Programming controlled by a cubic form automaton whose nodes correspond to matching status of reference strokes to input strokes. By preliminary experiments, it is demonstrated that the proposed algorithm works fast enough for practical application. A generalization to stroke--number free recognition is also investigated.続きを見る
|
Mendeley出力
