Online stroke segmentation by quick penalty‐based dynamic programming
Authors: 
Liu Wenyin, Tong Lu, Yu Yajie, Shuang Liang, Rui ZhangAuthors Info & Claims
Abstract
A stroke segmentation method named quick penalty‐based dynamic programming is proposed for splitting a sketchy stroke into several regular primitive shapes, such as line segments and elliptical arcs. The authors extend the dynamic programming framework with a customisable penalty function, which measures the correctness of splitting a stroke at a particular point. With the help of the penalty function, the proposed dynamic programming framework can finish the stroke segmentation process without any prior knowledge of the number and/or the type of segments contained in the sketchy stroke. Its response time is sufficiently short for online applications, even for long strokes. Experiments show that the proposed method is robust for strokes with arbitrary shape and size.
10 References
[1]
Alvarado, C., Davis, R.: ‘SketchREAD: a multi‐domain sketch recognition engine’. ACM SIGGRAPH 2007 Courses: 34, 2007
[2]
Zhu, B., Iwata, M., Haraguchi, R., et al: ‘Sketch‐based dynamic illustration of fluid systems’, ACM Trans. Graph., 2011, 30, (6), pp. 1–8
[3]
Wenyin, L., Kong, X., Wang, Y., et al: ‘QuickDiagram: a system for online sketching and understanding of diagrams’, in: Ogier, J.‐M., Liu, W., Lladós, J. (eds.), Graphics recognition. achievements, challenges, and evolution (Springer, Berlin/Heidelberg) (LNCS 6020), 2010, pp. 130–141
[4]
Dachselt, R., Frisch, M., Decker, E.: ‘Enhancing UML sketch tools with digital pens and paper’. Proc. Fourth ACM Symp. on Software Visualization, 2008, pp. 203–204
[5]
Shah, D., Schneider, J., Campbell, M.: ‘A robust sketch interface for natural robot control’. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2010, pp. 4458–4463
[6]
Yang, Z., Guangshun, S., Kai, W.: ‘A SVM‐HMM based online classifier for handwritten chemical symbols’. 20th Int. Conf. on Pattern Recognition, 2010, pp. 1888–1891
[7]
Olsen, L., Samavati, F., Sousa, M., Jorge, J.: ‘Sketch‐based modeling: survey’, Comput. Graph., 2009, 33, pp. 85–103
[8]
Kim, D.H., Kim, M.‐J.: ‘A curvature estimation for pen input segmentation: in sketch‐based modeling’, Comput.‐Aided Des., 2006, 38, pp. 238–248
[9]
Liu, Y., Yu, Y.J., Liu, W.Y.: ‘Online segmentation of freehand stroke by dynamic programming’. Proc. ICDAR, 2005, pp. 197–201
[10]
Rosenfeld, A., Johnston, E.: ‘Angle detection on digital curves’, IEEE Trans. Comput., 1973, 22, pp. 875–878
[11]
Rosenfeld, M.T., Lee, Y.H.: ‘Edge and curve detection: further experiments’, IEEE Trans. Comput., 1972, 21, pp. 677–715
[12]
Brault, J.J., Plamondon, R.: ‘Segmenting handwritten signatures at their perceptually important points’, IEEE Trans. Pattern Anal. Mach. Intell., 1993, 15, (9), pp. 953–957
[13]
Teh, C.H., Chin, R.T.: ‘On the detection of dominant points on digital curves’, IEEE Trans. Pattern Anal. Mach. Intell., 1989, 11, (8), pp. 859–872
[14]
Ray, B.K., Pandyan, R.: ‘ACORD – an adaptive corner detector for planar curves’, Pattern Recognit., 2003, 36, pp. 703–708
[15]
Herold, J., Stahovich, T.F.: ‘SpeedSeg: a technique for segmenting pen strokes using pen speed’, Comput. Graph., 2011, 35, (2), pp. 250–264
[16]
Noris, G., Sýkora, D., Shamir, A., et al: ‘Smart scribbles for sketch segmentation’, Comput. Graph. Forum, 2012, 31, pp. 2516–2527
[17]
Feng, G., Viard‐Gaudin, C., Sun, Z.: ‘On‐line hand‐drawn electric circuit diagram recognition using 2D dynamic programming’, Pattern Recognit., 2009, 42, (12), pp. 3215–3223
[18]
Horng, J.H., Li, J.T.: ‘A dynamic programming approach for fitting digital planar curves with line segments and circular arcs’, Pattern Recognit. Lett., 2001, 22, pp. 183–197
[19]
Tümen, R., Sezgin, M.: ‘DPFrag: a trainable stroke fragmentation framework based on dynamic programming’, IEEE Comput. Graph. Appl..
[20]
Hse, H., Shilman, M., Newton, A.R.: ‘Robust sketched symbol fragmentation using templates’. Int. Conf. Intelligent User Interface, Madeira, Portugal, 2004
[21]
Fitzgibbon, M.P., Fisher, R.B.: ‘Direct least square fitting of ellipses’, IEEE Trans. Pattern Anal. Mach. Intell., 1999, 21 pp. 476–480
Recommendations
Multi-oriented touching text character segmentation in graphical documents using dynamic programming
The touching character segmentation problem becomes complex when touching strings are multi-oriented. Moreover in graphical documents sometimes characters in a single-touching string have different orientations. Segmentation of such complex touching is ...
Radon transform and dynamic programming for the Persian handwritten zip code recognition
Pattern recognition is one of the major research areas in computer sciences. Optical character recognition OCR as one of the pattern recognition topics has specifically attracted the interests of many researchers. This paper presents a method for ...
Stroke Segmentation and Recognition from Bangla Online Handwritten Text
ICFHR '12: Proceedings of the 2012 International Conference on Frontiers in Handwriting RecognitionThis paper deals with recognition of online handwritten Bangla (Bengali) text. Here, at first, we segment cursive words into strokes. A stroke may represent a character or a part of a character. We selected a set of Bangla words written by different ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
© 2013 The Institution of Engineering and Technology.
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Published: 01 October 2013
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025