Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation

Thinning is a widely used pre–processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the “skeletons” of the objects are left. This paper presents three thinning algorithms according to three kinds of endpoint criteria. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. The proposed algorithms are based on Ronse’s sufficient conditions for topology preservation.

[1]  Richard W. Hall,et al.  Parallel Connectivity-Preserving Thinning Algorithms , 1996 .

[2]  T. Yung Kong,et al.  On Topology Preservation in 2-D and 3-D Thinning , 1995, Int. J. Pattern Recognit. Artif. Intell..

[3]  Christian Ronse,et al.  Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..

[4]  ULRICH ECKHARDT,et al.  Invariant Thinning , 1993, Int. J. Pattern Recognit. Artif. Intell..

[5]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[6]  Ching Y. Suen.  Thinning Methodologies for Pattern Recognition , 1994 .

[7]  Gilles Bertrand,et al.  Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels , 2008, Journal of Mathematical Imaging and Vision.

[8]  Ching Y. Suen,et al.  Thinning Methodologies - A Comprehensive Survey , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[10]  Alfred M. Bruckstein,et al.  Pruning Medial Axes , 1998, Comput. Vis. Image Underst..

[11]  Kálmán Palágyi,et al.  A 3D fully parallel surface-thinning algorithm , 2008, Theor. Comput. Sci..