1999
DOI: 10.1007/3-540-48172-9_10
|View full text |Cite
|
Sign up to set email alerts
|

Lexical Search Approach for Character-String Recognition

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

2000
2000
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…First of all, tracking the thinned curve in certain step to arrive a certain pixel Q from the endpoint P , the angle between the line PQ and , tan (5) So if the step length is 4 / , the normalized direction values of 8-pixel neighborhood of the pixel P is respectively 0, 1, 2, 3, 4, 5, 6, 7.…”
Section: A Thinningmentioning
confidence: 99%
See 1 more Smart Citation
“…First of all, tracking the thinned curve in certain step to arrive a certain pixel Q from the endpoint P , the angle between the line PQ and , tan (5) So if the step length is 4 / , the normalized direction values of 8-pixel neighborhood of the pixel P is respectively 0, 1, 2, 3, 4, 5, 6, 7.…”
Section: A Thinningmentioning
confidence: 99%
“…Commonly identification of numbers and letters is based on template matching OCR algorithm or artificial neural network OCR algorithm. Characters are often measured by contour, grid, projection and other statistical characteristic features [2][3][4][5][6][7][8]. For these applications, there are two main problems, the poor ability to distinguish between similar characters and the slow recognition speed caused by the increase of feature dimensions.…”
Section: Introductionmentioning
confidence: 99%
“…To cope with the difficulty in character segmentation, the lexically directed approach is adopted as shown in Fig. 10 [4,5]. The figure shows how the problem of non-uniform character size and spacing is approached.…”
Section: ) Size Matching 2) Line-segment Matching 3) Fix Area Word Mmentioning
confidence: 99%
“…Such methods do not sufficiently incorporate character shape information. On the other hand, over-segmentationbased methods attempt to split character patterns at their true boundaries and label the split character patterns [39][40][41][42][43][44][45][46]. Character patterns may also be split within them, but they are merged later.…”
Section: Introductionmentioning
confidence: 99%