An improved parallel thinning algorithm
- 1 February 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 30 (2) , 156-160
- https://doi.org/10.1145/12527.12531
Abstract
An iterative thinning algorithm reduces a two-dimensional pattern of strokes to its skeleton by removing layers of edge elements until each stroke has unit thickness. A parallel solution requires the independent calculation of new values for each iteration, using a window of nearest neighbors for each element. The traditional need for at least two subiterations can be avoided by modifying the window to permit the availability of intermediate calculations. Timings on an ICL DAP (an array processor) indicate an improvement of over 40 percent. Additional refinements are suggested to reduce noise in the final skeleton.Keywords
This publication has 2 references indexed in Scilit:
- A fast parallel algorithm for thinning digital patternsCommunications of the ACM, 1984
- Some Parallel Thinning Algorithms for Digital PicturesJournal of the ACM, 1971