A parallel thinning algorithm for medial surfaces

Abstract A new 3D parallel thinning algorithm for medial surfaces is proposed. It works in cubic grids with the 6-connectivity. This algorithm is based on a precise definition of end points which are points belonging to surfaces or curves. We give a necessary and sufficient Boolean condition for characterizing points which are simple, non-ends and which are border points of a certain type (N, S, E, W, U, D). The algorithm consists precisely in removing all points satisfying the condition: it has a little computational cost and it is based on a clear thinning criterion.

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

[2]  Gilles Bertrand,et al.  A new characterization of three-dimensional simple points , 1994, Pattern Recognition Letters.

[3]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

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

[5]  Gilles Bertrand,et al.  A Boolean characterization of three-dimensional simple points , 1996, Pattern Recognition Letters.

[6]  Gilles Bertrand,et al.  Three-dimensional thinning algorithm using subfields , 1995, Other Conferences.

[7]  Partha Pratim Das,et al.  On connectivity issues of ESPTA , 1990, Pattern Recognit. Lett..

[8]  Gilles Bertrand,et al.  A simple parallel 3D thinning algorithm , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[9]  Cherng-Min Ma.  Sufficient conditions for 3D 6-subiteration parallel thinning algorithms to preserve connectivity , 1995, Other Conferences.

[10]  T. Yung Kong,et al.  A digital fundamental group , 1989, Comput. Graph..

[11]  Gilles Bertrand,et al.  A New Topological Classification of Points in 3D Images , 1992, ECCV.