Ultra-Fast Skeleton Based on an Isotropic Fully Parallel Algorithm

In this paper we introduce a new thinning algorithm, called MB, which is optimized with respect to the total number of elementary Boolean operators needed to perform it. We first emphasize the sound foundations of the algorithm, which is built by expressing into the Boolean language the three following constraints: (1) homotopy, (2) median axis and (3) isotropy. The MB algorithm benefits from both novel algorithmic ideas and systematic logic minimization. By hunting down any redundancy in the expressions of topological/geometrical features, we achieve a procedure that is: firstly, dramatically low-cost, as it is completely computed in 18 Boolean binary operators per iteration, and secondly, fully parallel, or one-single-pass, which guarantees that the number of iterations equals half the biggest object thickness.

[1]  Zicheng Guo,et al.  Fast fully parallel thinning algorithms , 1991, CVGIP Image Underst..

[2]  Keiichi Abe,et al.  Binary picture thinning by an iterative parallel two-subcycle operation , 1987, Pattern Recognit..

[3]  Alan Stewart.  A one-pass thinning algorithm with interference guards , 1994, Pattern Recognit. Lett..

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

[5]  Richard W. Hall.  Optimally Small Operator Supports for Fully Parallel Thinning Algorithms , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[7]  Jan Olszewski,et al.  A flexible thinning algorithm allowing parallel, sequential, and distributed application , 1992, TOMS.

[8]  Carlo Arcelli.  A condition for digital points removal , 1979 .

[9]  Wen-Hsiang Tsai,et al.  A new fast one-pass thinning algorithm and its parallel hardware implementation , 1990, Pattern Recognit. Lett..

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

[11]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[12]  C. J. Hilditch,et al.  Linear Skeletons From Square Cupboards , 1969 .

[13]  Ching Y. Suen,et al.  An Evaluation of Parallel Thinning Algorithms for Character Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

[15]  Thierry M. Bernard,et al.  Advanced Focal Plane Arrays and Electronic Cameras , 1996 .

[16]  Christian Ronse,et al.  A Topological Characterization of Thinning , 1986, Theor. Comput. Sci..

[17]  Federico Thomas,et al.  Residuals + directional GAPS = skeletons , 1997, Pattern Recognit. Lett..

[18]  Wen-Hsiang Tsai,et al.  A new one-pass parallel thinning algorithm for binary images , 1992, Pattern Recognit. Lett..

[19]  Roland T. Chin,et al.  Analysis of Thinning Algorithms Using Mathematical Morphology , 1990, IEEE Trans. Pattern Anal. Mach. Intell..