H. E. Lü
Abstract
A fast parallel thinning algorithm for digital patterns is presented. This algorithm is an improved version of the algorithms introduced by Zhang and Suen [5] and Stefanelli and Rosenfeld [3]. An experiment using an Apple II and an Epson printer was conducted. The results show that the improved algorithm overcomes some of the disadvantages found in [5] by preserving necessary and essential structures for certain patterns which should not be deleted and maintains very fast speed, from about 1.5 to 2.3 times faster than the four-step and two-step methods described in [3] although the resulting skeletons look basically the same.
- 1 Fu, KS., and Rosenfeld, A. Pattern recognition and image processing. IEEE Trans. Compuf. C-25,12 (Dec. 1976). 1336-1346.Google Scholar
- 2 Pavlidis, T. A flexible parallel thinning algorithm. In Proceedings of IEEE Computer Society Conference on Pattern Recognition and image Processing. Aug. 1981, 162-167.Google Scholar
- 3 Stefanelli. S., and Rosenfeld, A. Some parallel thinning algorithms for digital picture. 1. ACM 18, (Apr. 19711, 255-264. Google ScholarDigital Library
- 4 Wang, P.S.P. Ed. Intelligent Sysfems, Imaging Technology and Software Engineering. Sungkang Computer Book Co., Taipei, Taiwan, 1984.Google Scholar
- 5 Zhang, T.Y., and Suen, C.Y. A fast parallel algorithm for thinning digital patterns. Commun. ACM 27, 3 (Mar. 1984), 236-239. Google ScholarDigital Library
Index Terms
- A comment on “a fast parallel algorithm for thinning digital patterns”
Recommendations
Fast parallel thinning algorithms: parallel speed and connectivity preservation
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) ...
A Fast and Flexible Thinning Algorithm
A fast serial and parallel algorithm for thinning digital patterns is presented. The processing speed is faster than previous algorithms in that it reads pixels along the edge of the input pattern rather than all pixels in each iteration. Using this ...
Reviews
Keith Alan Paton
The authors seek to speed up the algorithm described by Rosenfeld and Kak [1] for the parallel thinning of digital patterns. They achieve a two-fold speed-up at the cost of destroying the algorithm; their version cannot be relied on to preserve the number of components in the original pattern. A simple example is the pattern of four dots in a square :6WWf which, as the authors point out, will be totally destroyed by the authors' version of the algorithm.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments