2009
DOI: 10.1007/s10032-009-0082-z
|View full text |Cite
|
Sign up to set email alerts
|

A pseudo-skeletonization algorithm for static handwritten scripts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…In reality, some researchers [33][34][35] exclude unreliable skeleton segments from consideration whilst others treat those as clues and examine their internal structure carefully [3,36]. Researchers have also investigated specialized handwriting skeletonisation techniques [32,[37][38][39][40][41].…”
Section: Skeletonmentioning
confidence: 99%
“…In reality, some researchers [33][34][35] exclude unreliable skeleton segments from consideration whilst others treat those as clues and examine their internal structure carefully [3,36]. Researchers have also investigated specialized handwriting skeletonisation techniques [32,[37][38][39][40][41].…”
Section: Skeletonmentioning
confidence: 99%
“…However, the skeleton topology of most well-known algorithms always is resulted with a lot of ambiguous regions around the junction point. Therefore, in the field of trajectory recovery, some authors [6], [9]- [11] have tried to overcome problem of skeleton by creating specialized skeleton result for their own use. Nevertheless, this process makes their algorithm cost more processing time and complex to follow.…”
Section: Introductionmentioning
confidence: 99%