A one-pass thinning algorithm and its parallel implementation

This paper describes a one-pass thinning algorithm that requires only a single cycle of parallel operations per iteration. The major difference between this algorithm and the usual multiple-pass 3 × 3 operators is that it uses two restoring templates (a 1 × 4 and a 4 × 1 operator) to deal with the breakage and disappearance of horizontal and vertical two pixel wide limbs. Connectedness of skeletons has been verified and limitations of the algorithm have been discussed. Results of a comparative study are also presented. In addition, a realization of the thinning algorithm is suggested with processing speed limited only to the propagation delays of logic gates. © 1987.link_to_subscribed_fulltex