Parallel thinning with two-subiteration algorithms
- 1 March 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 32 (3) , 359-373
- https://doi.org/10.1145/62065.62074
Abstract
Two parallel thinning algorithms are presented and evaluated in this article. The two algorithms use two-subiteration approaches: (1) alternatively deleting north and east and then south and west boundary pixels and (2) alternately applying a thinning operator to one of two subfields. Image connectivities are proven to be preserved and the algorithms' speed and medial curve thinness are compared to other two-subiteration approaches and a fully parallel approach. Both approaches produce very thin medial curves and the second achieves the fastest overall parallel thinning.Keywords
This publication has 16 references indexed in Scilit:
- Fast parallel thinning algorithms: parallel speed and connectivity preservationCommunications of the ACM, 1989
- A one-pass thinning algorithm and its parallel implementationComputer Vision, Graphics, and Image Processing, 1987
- An improved parallel thinning algorithmCommunications of the ACM, 1987
- A comment on “a fast parallel algorithm for thinning digital patterns”Communications of the ACM, 1986
- A fast parallel algorithm for thinning digital patternsCommunications of the ACM, 1984
- A characterization of parallel thinning algorithmsInformation and Control, 1975
- Parallel thinning of binary picturesElectronics Letters, 1975
- Some Parallel Thinning Algorithms for Digital PicturesJournal of the ACM, 1971
- Connectivity in Digital PicturesJournal of the ACM, 1970
- Pattern RecognitionJournal of the Royal Statistical Society. Series A (General), 1966