Stroke correspondence search for on-line character recognition using intra- and inter-stroke information

As a means to perform stroke order-free and stroke number-free on-line character recognition, this paper describes a new systematic stroke correspondence search algorithm. Inter-stroke information on the mutual relation among strokes and conventional individual intra-stroke information on the shape and position of each stroke are both employed. This search algorithm simultaneously performs both (i) stroke correspondence and (ii) stroke connection, further using both (iii) inter-stroke information and (iv) intra-stroke information. Experiments demonstrate high recognition capability, as well as computational feasibility.