Answers are grounded in this paper and cite their sources.
The article presents a handwritten digit string recognition algorithm based on matching input subgraphs with prototype symbol graphs. The article defines a set of acceptable graph transformations corresponding to typical variations of the handwritten symbols. The search for a match between the input subgraph and prototype graph is conducted using this set of transformations. This approach allows us to solve the problems of structure recognition methods caused by a high variability of handwritten symbol topology. The article presents experimental results of the handwritten digit string recognition system.
No takes yet. Share an insight, caveat, or question.
Filatov et al. (2002) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: