Extracting medial curves on 3D images

This paper proposes a 2-subfield thinning algorithm for extracting medial curves on 3D binary images where the set of all voxels of an image is partitioned into two isometric subsets and the algorithm works alternatively on each subset at a time. The thinning algorithm is proved to preserve topology. An algorithm for verifying the topology soundness of thinning algorithms should be established to simplify the procedure for preparing such proofs.

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

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

[3]  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..

[4]  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,.

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

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

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

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

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

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