| Creator |
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| JaLC DOI |
|
| Related DOI |
|
| Related URI |
|
| Relation |
|
| Abstract |
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.show more
|
Export Mendeley
p099