We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Online stroke segmentation by quick penalty-based dynamic programming.
- Authors
Liu Wenyin; Tong Lu; Yu Yajie; Shuang Liang; Rui Zhang
- 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.
- Subjects
IMAGE segmentation; DYNAMIC programming; ROBUST control; REACTION time; APPLICATION software
- Publication
IET Computer Vision (Wiley-Blackwell), 2013, Vol 7, Issue 5, p311
- ISSN
1751-9632
- Publication type
Article
- DOI
10.1049/iet-cvi.2012.0296