1992
DOI: 10.1016/0031-3203(92)90147-b
|View full text |Cite
|
Sign up to set email alerts
|

Recognition of large-set printed Hangul (Korean script) by two-stage backpropagation neural classifier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1995
1995
2019
2019

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…In recent years, neural networks have shown a high recognition accuracy for digital [9], natural scene [10]- [12], and handwritten characters [13], [14]. Regarding Korean Hangul, methods of modeling its structural features have been proposed [15], [16] and recognition by neural networks have been used [17].…”
Section: Related Workmentioning
confidence: 99%
“…In recent years, neural networks have shown a high recognition accuracy for digital [9], natural scene [10]- [12], and handwritten characters [13], [14]. Regarding Korean Hangul, methods of modeling its structural features have been proposed [15], [16] and recognition by neural networks have been used [17].…”
Section: Related Workmentioning
confidence: 99%
“…consonants on their left (top). The shape of a vowel varies depending on its position and accompanying symbols [6].…”
Section: Table 1 Classification Of Korean Phonemesmentioning
confidence: 99%
“…Then by a graph search algorithm, DP matching costs are calculated between segment 5 and each of segments 2, 4, 3, 6, 7, 8, and 9. The final sequence (5,4,6,8) minimum cost is extracted as a set of segments corresponding to the line segment ' '. To apply DP matching to 2D patterns we extend this algorithm by concatenating DP matching cost planes according to the branch and bound control strategy.…”
Section: Branch and Bound Algorithm Based On Dp Matchingmentioning
confidence: 99%
See 2 more Smart Citations