Parallel Thinning Algorithms on 3D (18, 6) Binary Images

Thinning algorithms on binary images are used to generate skeletons that preserve the same connectivity structures as the objects in the original images. Two kinds of skeletons may be appropriate for 3D thinning algorithms: digital curves and digital surfaces. We propose two thinning algorithms on 3D (18, 6) binary images. One algorithm generates skeletons as digital curves and the other algorithm generates skeletons as digital surfaces. Both algorithms are 6-subiteration algorithms?in each iteration, they are applied alternatively to delete border voxels from each of the six directions, upper, lower, north, south, east, and west.

[1]  A. W. Roscoe,et al.  Concepts of digital topology , 1992 .

[2]  T. Yung Kong,et al.  Problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology , 1993, Other Conferences.

[3]  Cherng Min Ma,et al.  On topology preservation in 3D thinning , 1994 .

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

[5]  Azriel Rosenfeld,et al.  A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..

[6]  Cherng-Min Ma.  Connectivity Preservation of 3D 6-Subiteration Thinning Algorithms , 1996, CVGIP Graph. Model. Image Process..

[7]  Azriel Rosenfeld,et al.  Determining simplicity and computing topological change in strongly normal partial tilings of R2 or R3 , 2000, Pattern Recognit..

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

[9]  Attila Kuba,et al.  A 3D 6-subiteration thinning algorithm for extracting medial lines , 1998, Pattern Recognit. Lett..

[10]  Longin Jan Latecki,et al.  An Algorithm for a 3D Simplicity Test , 1996, Comput. Vis. Image Underst..

[11]  Richard W. Hall.  Connectivity-preserving parallel operators in 2D and 3D images , 1993, Other Conferences.

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

[13]  R. W. Hall.  Tests for connectivity preservation for parallel reduction operators , 1992 .

[14]  Milan Sonka,et al.  A Fully Parallel 3D Thinning Algorithm and Its Applications , 1996, Comput. Vis. Image Underst..

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

[16]  Cherng-Min Ma.  Topology preservation on 3D images , 1993, Other Conferences.

[17]  Bidyut Baran Chaudhuri,et al.  Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Gilles Bertrand,et al.  Simple points, topological numbers and geodesic neighborhoods in cubic grids , 1994, Pattern Recognit. Lett..

[19]  Gilles Bertrand,et al.  A parallel thinning algorithm for medial surfaces , 1995, Pattern Recognit. Lett..

[20]  Ronald H. Perrott,et al.  An improved parallel thinning algorithm , 1987, CACM.