Lecture Notes in Computer Science- P74:This year, we received about 170 submissions to ICWL 2008. There were a total of 52 full papers, representing an acceptance rate of about 30%, plus one invited paper accepted for inclusion in this LNCS proceedings. The authors of these accepted papers | 354 Z. Hu H. Leung and Y. Xu of the template is already known in the database. Hence the stroke sequence can be easily verified based on the stroke correspondence. Computational complexity. We apply our pruning strategy to the graph matching and compare the computational time with the existing method in 6 . The method in 6 also makes use of graph matching to find out the difference between the template and sample but without applying the pruning strategy. From Figure 9 a it can be observed that the performance of finding stroke production errors for the method with and without pruning is similar. However our proposed method is faster than the one in 6 as illustrated in Figure 9 b . The results show that our method can handle more kinds of handwriting errors such as stroke production errors spatial relationship errors and stroke sequence error compared with existing methods. While our method can locate more kinds of handwriting errors with less computational time the accuracy of our approach also outperforms existing methods. 4 Conclusion In this paper we have used the attributed relational graph to represent a Chinese handwriting character incorporating the spatial relationship information between strokes. A refined interval relationship with more granular levels is proposed to model the Chinese characters. A novel interval neighborhood graph is also proposed to compute the distances among the refined interval relationships. A pruning strategy is adopted to assist the A algorithm in searching for the optimal matching and lowering the computational complexity. The experiments show that our proposal can handle more kinds of handwriting errors than existing methods with less computational time. To further improve the performance of our method future work may focus on improving the current definition of relationship by combining the relationship along praxis and y-axis to form a new relationship and find a more computationally efficient pruning strategy based on the .
