A parallel graytone thinning algorithm (PGTA)

Authors:
M. K. Kundu;B. B. Chaudhuri;D. Dutta Majumder
Affiliations:
-;-;-
Venue:
Pattern Recognition Letters
Year:
1991

Citing 5
Cited 0

A comment on “a fast parallel algorithm for thinning digital patterns”

Communications of the ACM - The MIT Press scientific computation series
Computer processing of line images: a survey

Pattern Recognition
A fast parallel algorithm for thinning digital patterns

Communications of the ACM
A Min-Max Medial Axis Transformation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Greylevel edge thinning: A new method

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

A parallel graytone thinning algorithm (PGTA) is proposed in this paper. This algorithm is a generalization of a well-known two-tone thinning algorithm of ^Z^h^a^n^g^ ^a^n^d^ ^S^u^e^n^ ^(^1^9^8^4^) and is equally applicable for both graytone and two-tone images. The performance of PGTA is demonstrated on a variety of images, where it is seen that PGTA not only thins the object but also enhances the object-background contrast.