An improved parallel thinning algorithm with two subiterations

Abstract

The parallel thinning algorithm with two subiterations is improved in this paper. By analyzing the notions of connected components and passes, a conclusion is drawn that the number of passes and the number of eight-connected components are equal. Then the expression of the number of eight-connected components is obtained which replaces the old one in the algorithm. And a reserving condition is proposed by experiments, which alleviates the excess deletion where a diagonal line and a beeline intersect. The experimental results demonstrate that the thinned curve is almost located in the middle of the original curve connectively with single pixel width and the processing speed is high.

References

[1] ZhangT.Y., SuenC.Y.. Commun. ACM, 1984, 27: 236

[2] KwonJ.-S., GiJ.-W., KangE.-K.. Proceedings.2001 International Conference on Image Processing, 2001, 3: 752

[3] GuoZ., HallR. W.. Commun. ACM, 1989, 32: 359

[4] ZhangY.Y., WangP.S.P.. Proc. IEEE Int’l Conf. Pattern Recognition, 1996, 4: 457

[5] LüH.E., WangP.S.P.. Commun. ACM, 1986, 29: 239

[6] LL., SuenC.Y.. IEEE Trans. PAML, 1995, 17: 914

[7] AhmedM., WardR.. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2002, 24: 1672

[8] RockettP. I.. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2005, 27: 1671