1988
DOI: 10.1016/0167-8655(88)90124-9
|View full text |Cite
|
Sign up to set email alerts
|

A modified fast parallel algorithm for thinning digital patterns

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

1998
1998
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 100 publications
(35 citation statements)
references
References 7 publications
0
35
0
Order By: Relevance
“…A survey of 2D thinning algorithms and their applications can be found in [1]. Early thinning algorithms were designed for serial implementations, but since parallel computers are available several approaches have been developed with parallel processing in mind [2][3][4][5][6]. Some implementations on parallel computers have been reported in [7] for a shared memory architecture and in [8] for massively SIMD machines.…”
Section: Introductionmentioning
confidence: 99%
“…A survey of 2D thinning algorithms and their applications can be found in [1]. Early thinning algorithms were designed for serial implementations, but since parallel computers are available several approaches have been developed with parallel processing in mind [2][3][4][5][6]. Some implementations on parallel computers have been reported in [7] for a shared memory architecture and in [8] for massively SIMD machines.…”
Section: Introductionmentioning
confidence: 99%
“…In this study, we used the Zhang-Suen thinning method [13] because this method has good efficiency and is fast in obtaining the skeleton. The next process is to extract features or characteristics that are able to distinguish between letters, one of which is shape energy.…”
Section: Feature Extractionmentioning
confidence: 99%
“…The first cycle will be executed at odd iterations while the second cycle will be executed at even iterations. A detailed explanation of the implementation of these two subcycles is given in [54].…”
Section: ) Edge Thinningmentioning
confidence: 99%
“…The fast parallel thinning algorithm by Chen and Hsu [54] was used here, because this algorithm preserves the merits of the original such as the edge noise immunity and good effect in thinning crossing lines, and overcomes the weaknesses such as the serious shrinking and line connectivity problems. A 3 3 window is used (Fig.…”
Section: ) Edge Thinningmentioning
confidence: 99%