2011
DOI: 10.1016/j.cag.2010.12.003
|View full text |Cite
|
Sign up to set email alerts
|

SpeedSeg: A technique for segmenting pen strokes using pen speed

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 26 publications
0
19
0
Order By: Relevance
“…RankFrag has only been tested for finding corner points and not tangent vertices, as done by other techniques [12,1]. It can be directly used in various structural methods for symbol recognition.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…RankFrag has only been tested for finding corner points and not tangent vertices, as done by other techniques [12,1]. It can be directly used in various structural methods for symbol recognition.…”
Section: Discussionmentioning
confidence: 99%
“…SpeedSeg [12] and TCVD [1] are examples of such methods. TCVD is also able to find both the corners and the points where there is a significant change in curvature (referred to as "tangent vertices" in [1]).…”
Section: Related Workmentioning
confidence: 99%
“…9 In contrast, our method finds piecewise approximations via dynamic programming combined with an adaptive cost function.…”
Section: Piecewise Approximationmentioning
confidence: 99%
“…Therefore, the first step towards the development of an interactive natural user interface is to minimize the uncertainty in the captured motion through segmentation. Threshold based algorithms are the most common approach in segmentation which is applied to some motion features such as curvature or speed [3][4].…”
Section: Introductionmentioning
confidence: 99%
“…Although the problem of sketch processing in this approach can be solved all in one stage, this method is computationally expensive and therefore not suitable for realtime applications. This problem can be overcome by employing dynamic programming [12,13] or using hybrid methods where fragmentation and segmentations are combined [4], [14]. Usually hybrid approaches are constist of two phases in which segmention is performed at first and then fragmentation is applied to the segments.…”
Section: Introductionmentioning
confidence: 99%