This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization problem of "fitting to a template". A nested recursive optimization process is then designed by means of dynamic programming to do stroke segmentation and symbol recognition cooperatively by minimizing the fitting errors between inputting patterns and templates. Experimental results prove the effectiveness of the proposed method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Sun, Z. X., Yuan, B., & Yin, J. (2006). Online composite sketchy shape recognition using dynamic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3926 LNCS, pp. 255–266). Springer Verlag. https://doi.org/10.1007/11767978_23
Mendeley helps you to discover research relevant for your work.