1995
DOI: 10.1002/scj.4690261303
|View full text |Cite
|
Sign up to set email alerts
|

Robust and fast text‐line extraction using local linearity of the text‐line

Abstract: SUMMARYText region extraction is a necessary process before character recognition is done for document images. This paper describes a new algorithm, Linear Segment Linking (LSL), for text-line extraction from document images. The algorithm groups together the piecewise linear elements in the document images, which may be assumed to be text lines, and then extracts them from the images. The algorithm requires less knowledge about document structure and is robust for distortion of the image. The primitive rectan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1999
1999
2002
2002

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…One is called stroke width, which is defined as the non-unit runlength, the number of that runlength ap pears a peak in runlength histogram (3). As shown in Fig.…”
Section: Text Region Extractionmentioning
confidence: 99%
“…One is called stroke width, which is defined as the non-unit runlength, the number of that runlength ap pears a peak in runlength histogram (3). As shown in Fig.…”
Section: Text Region Extractionmentioning
confidence: 99%
“…The blocks are obtained by smearing the image, so that adjacent connected components are merged into one block if the distance between them is less than the smearing threshold. 4,15 Because it is a rule that the space between letters is narrower than the width of a letter, 10 the smearing threshold varies dynamically with the local average label width.…”
Section: Block Segmentationmentioning
confidence: 99%