The State of the Art in Online Handwriting Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
A study of moment functions and its use in Chinese character recognition
ICDAR '97 Proceedings of the 4th International Conference on Document Analysis and Recognition
An on-line Japanese character recognition method using length-based stroke correspondence algorithm
ICDAR '97 Proceedings of the 4th International Conference on Document Analysis and Recognition
A Robotic Teacher of Chinese Handwriting
HAPTICS '02 Proceedings of the 10th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems
An Algorithm for On-Line Strokes Verification of Chinese Characters Using Discrete Features
IWFHR '02 Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02)
Peer Review in an Online College Writing Course
ICALT '04 Proceedings of the IEEE International Conference on Advanced Learning Technologies
Graph edit distance with node splitting and merging, and its application to diatom identification
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
A web-based chinese handwriting education system with automatic feedback and analysis
ICWL'06 Proceedings of the 5th international conference on Advances in Web Based Learning
Automated Chinese Handwriting Error Detection Using Attributed Relational Graph Matching
ICWL '08 Proceedings of the 7th international conference on Advances in Web Based Learning
Hi-index | 0.00 |
People may make mistakes in writing a Chinese character. In this paper, we apply error-tolerant graph matching to find the stroke production errors in people's handwriting of Chinese characters. A set of edit operations to transform one graph into another are defined for achieving this purpose. The matching procedure is denoted as a search problem of finding the minimum edit distance. The A* algorithm is used to perform the searching. Experiments show that the proposed method outperforms existing algorithms in identifying stroke production errors. The proposed method can help in Chinese handwriting education by providing feedback to correct users who have stroke production errors in writing a Chinese character.