Cybernetics and Systems ’86 1986
DOI: 10.1007/978-94-009-4634-7_117
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Serial and Parallel Thinning Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

1989
1989
2022
2022

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…For example, the molar area (Figure 5c) is nearly vertical; the crown Detection of the dental arch curve based on mask images. Firstly, the mask image (Figure 4a) is processed by the thinning algorithm [29][30][31], and the bifurcation endpoint template of 8 fields is added to compare the skeleton line in the refinement calculation process (Figure 4b), the bifurcation and endpoint structure in the skeleton are recorded, and the branching statistics and fork removal are performed (Figure 4c). Then, the insertion point is determined on the skeleton.…”
Section: Dental Arch Curve Detectionmentioning
confidence: 99%
“…For example, the molar area (Figure 5c) is nearly vertical; the crown Detection of the dental arch curve based on mask images. Firstly, the mask image (Figure 4a) is processed by the thinning algorithm [29][30][31], and the bifurcation endpoint template of 8 fields is added to compare the skeleton line in the refinement calculation process (Figure 4b), the bifurcation and endpoint structure in the skeleton are recorded, and the branching statistics and fork removal are performed (Figure 4c). Then, the insertion point is determined on the skeleton.…”
Section: Dental Arch Curve Detectionmentioning
confidence: 99%
“…In fast Parallel Thinning Algorithm, the method for extracting the skeleton of a picture consists of removing all the contour points of the picture except those points that belong to the skeleton [16] [18]. In order to preserve the connectivity of skeleton, each iteration is divided into two sub-iterations [17].…”
Section: Voronoi Diagrammentioning
confidence: 99%
“…After the binarized image is obtained, the next and most important step is to thin the image -i.e., to make the ridges of the image as thin as 1-pixel, without disturbing the basic structure and details of the image. The thinning algorithms devised to date [1][2][3][4][5][6][7] do not provide positional and rotational invariance, nor are they appropriate for removing lakes and island type regions from the fingerprint.…”
Section: Maria: Minutia Analysis Using Rotation Invariant Algorithmmentioning
confidence: 99%