Fast parallel thinning algorithms: parallel speed and connectivity preservation
- 1 January 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 32 (1) , 124-131
- https://doi.org/10.1145/63238.63248
Abstract
A recently published parallel thinning approach [ 4 ] is evaluated. An improvement is suggested to enable preservation of certain diagonal lines which are not preserved by this algorithm. A unified notion of what is meant by an iteration (or subiteration) and parallel speed is presented, and with regard to its parallel speed this algorithm is argued to be comparable to other two-subiteration algorithms. The parallel speed of this algorithm is compared experimentally to the original algorithm that it improves [ 12 ] and it is shown that, unlike execution time on a specific machine, parallel speed is not improved. Finally, a more complete connectivity analysis is given illustrating sufficient additional conditions for applying fully in parallel the basic thinning operator used in both algorithms while maintaining all image connectivity properties.Keywords
This publication has 10 references indexed in Scilit:
- 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 Serial and Parallel Thinning AlgorithmPublished by Springer Nature ,1986
- A fast parallel algorithm for thinning digital patternsCommunications of the ACM, 1984
- Modern Cellular AutomataPublished by Springer Nature ,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
- Hexagonal Parallel Pattern TransformationsIEEE Transactions on Computers, 1969
- Pattern RecognitionJournal of the Royal Statistical Society. Series A (General), 1966