2005
DOI: 10.1109/tpami.2005.89
|View full text |Cite
|
Sign up to set email alerts
|

A parallel-line detection algorithm based on HMM decoding

Abstract: The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraction from rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper, we propose a novel model-based method which incorporates high-level context to detect these lines. After preprocessing (such as skew correction and text filtering), we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines s… 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

2013
2013
2018
2018

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…The user can correct the extraction result if necessary. There are numerous segment vectorization methods [29,30,5]. By combining our algorithm with one of these methods, detectability, and robustness would be improved.…”
Section: D Elements Extractionmentioning
confidence: 99%
“…The user can correct the extraction result if necessary. There are numerous segment vectorization methods [29,30,5]. By combining our algorithm with one of these methods, detectability, and robustness would be improved.…”
Section: D Elements Extractionmentioning
confidence: 99%
“…Regarding line detection, the well known and most used algorithm is used, i.e. Hough's transform [14], but other algorithms can be used too, as in [15][16][17][18].…”
Section: Introductionmentioning
confidence: 99%