Three-Dimensional Topology Preserving Reduction on the 4-Subfields

This paper discusses thinning on 3D binary images with the 4-subfield approach. Although a thinning algorithm concerns binary images, the algorithm itself can be represented as a set of three-color reduction templates. A thinning algorithm is topology preserving if the set of all three-color templates is topology preserving. Sufficient and necessary conditions of time complexity O(n) were proposed for verifying the topological soundness of a 3D 4-subfield thinning algorithm of n three-color templates. Theories and techniques for computerizing such conditions were discussed. Two 4-subfield thinning algorithms on 3D images, one for generating medial curves, and the other one for generating medial surfaces, are proposed and proved to preserve topology by our sufficient and necessary conditions.

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

[2]  Zicheng Guo,et al.  Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.

[3]  King-Sun Fu,et al.  A parallel thinning algorithm for 3-D pictures , 1981 .

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

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

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

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

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

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

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

[11]  Grégoire Malandain,et al.  Fast characterization of 3D simple points , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[12]  Azriel Rosenfeld,et al.  Connectivity and genus in three dimensions , 1971 .

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

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

[15]  Francoise J. Preteux,et al.  Unified mathematical framework for a compact and fully parallel n-D skeletonization procedure , 1999, Optics & Photonics.

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

[17]  Shu-Yen Wan,et al.  A medial-surface oriented 3-d two-subfield thinning algorithm , 2001, Pattern Recognit. Lett..

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

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

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

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

[22]  Antoine Manzanera,et al.  Medial faces from a concise 3D thinning algorithm , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[23]  Christophe Lohou,et al.  A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points , 2002, DGCI.

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