This Article 
 Bibliographic References 
 Add to: 
Three-Dimensional Topology Preserving Reduction on the 4-Subfields
December 2002 (vol. 24 no. 12)
pp. 1594-1605

Abstract—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 {\rm{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] G. Bertrand and Z. Aktouf, “A 3D Thinning Algorithm Using Subfields,” Proc. SPIE Conf. Vision Geometry, pp. 113-124, 1994.
[2] Z. Guo and R.W. Hall, “Parallel Thinning with Two-Subiteration Algorithms,” Comm. ACM, vol. 32, no. 3, pp. 359-373, 1989.
[3] R.W. Hall, “Tests for Topology Preservation for Parallel Reduction Operators,” Topology and Its Applications, vol. 46, pp. 199-217, 1992.
[4] R.W. Hall, “Connectivity-Preserving Parallel Operators in 2D and 3D Images,” Proc. SPIE Conf. Vision Geometry, pp. 172-183, 1992.
[5] P. Bates,“Distributed debugging tools for heterogeneous distributed systems,” Proc. 8th Int’l Conf. on Distributed Computing Systems,San Jose, Calif., June 1988, pp. 308-315.
[6] T.Y. Kong, “On Topology Preservation in 2-D and 3-D Thinning,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 9, pp. 813-844, 1995.
[7] T.Y. Kong, “On the Problem of Determining Whether a Parallel Reduction Operator for n-Dimensional Binary Images Always Preserves Topology,” Proc. SPIE Conf. Vision Geometry, pp. 69-77, 1993.
[8] T.Y. Kong, A.W. Roscoe, and A. Rosenfeld, “Concepts of Digital Topology,” Topology and Its Applications, vol. 46, pp. 219-262, 1992.
[9] T.Y. Kong and A. Rosenfeld, “Digital Topology: Introduction and Survey,” Computer Vision GI Processing, vol. 48, pp. 357-393, 1989.
[10] T.Y. Kong, “A Digital Fundamental Group,” Computers and Graphics, vol. 13, no. 2, pp. 159-166, 1989.
[11] L. Latecki and C.M. Ma, “An Algorithm for a 3D Simplicity Test,” Computer Vision and Image Understanding, vol. 63, no. 2, pp. 388-393, 1996.
[12] C. Lohou and G. Bertrand, “A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points,” Proc. 10th Int'l Conf. Discrete Geometry for Computer Imagery, pp. 102-113, 2002.
[13] C. Lohou and G. Bertrand, “New Fully Parallel Thinning Algorithms for 2D and 3D Binary Images Based on P-Simple Points,” Proc. SPIE Vision Geometry IX, 2002.
[14] C.M. Ma, “On Topology Preservation in 3D Thinning,” Proc. CVGIP: Image Understanding, vol. 59, pp. 328-339, 1994.
[15] C.M. Ma and S.Y. Wan, “A Medial-Surface Oriented 3-D Two-Subfield Thinning Algorithm,” Pattern Recognition Letters, vol. 22, pp. 1439-1446, 2001.
[16] G. Malandain and G. Bertrand, “Fast Characterization of 3D Simple Points,” Proc. 11th IAPR Int'l Conf. Pattern Recognition, vol. III, pp. 232-235, 1992.
[17] A. Manzanera, T.M. Bernard, F. Prêteux, and B. Longuet, “Medial Faces from a Concise 3D Thinning Algorithm,” Proc. IEEE Int'l Conf. Computer Vision, pp. 337-343, 1999.
[18] A. Manzanera, T.M. Bernard, F. Prêteux, and B. Longuet, “A Unified Mathematical Framework for a Compact and Fully Parallel n-D Skeletonization Procedure,” Proc. SPIE Conf. 3811 Vision Geometry VIII, pp. 18-23, 1999.
[19] D.G. Morgenthaler, “Three-Dimensional Simple Points: Serial Erosion, Parallel Thinning and Skeletonization,” Technical Report-1005, Univ. of Maryland, Feb. 1981.
[20] K. Palágyi and A. Kuba, “A 3D 6-Subiteration Thinning Algorithm for Extracting Medial Surfaces,” Pattern Recognition Letters, vol. 19, pp. 613-627, 1998.
[21] C.M. Park and A. Rosenfeld, “Connectivity and Genus in Three Dimensions,” Technical Report 156, Univ. of Maryland, May 1971.
[22] C. Ronse, “A Topological Characterization of Thinning,” Theoretical Computer Science, vol. 43, pp. 31-41, 1986.
[23] C. Ronse, “Minimal Test Patterns for Topology Preservation in Parallel Thinning Algorithm for Binary Images,” Discrete Applied Math., vol. 21, pp. 67-79, 1988.
[24] A. Rosenfeld, “A Characterization of Parallel Thinning Algorithms,” Information and Control, vol. 29, pp. 286-291, 1976.
[25] P.K. Saha, B. Chanda, and D.D. Majumder, “Principles and Algorithms for 2D and 3D Shrinking,” Technical Report TR/KBCS/2/91, N.C.K.B.C.S. Library, Indian Statistical Inst., Calcutta, India, 1991.
[26] P.K. Saha and A. Rosenfeld, “Determining Simplicity and Computing Topological Change in Strongly Normal Partial Tilings of$\big. R^2\bigr.$or$\big. R^3\bigr.$,“ Pattern Recognition, vol. 33, pp. 105-118, 2000.
[27] Y.F. Tsao and K.S. Fu, “A Parallel Thinning Algorithm for 3-D Pictures,” Computer Graphics Image Processing, vol. 17, pp. 513-331, 1981.

Index Terms:
Topology preservation, connectivity preservation, 3D thinning algorithm, thinning, 4-subfield thinning.
Cherng-Min Ma, Shu-Yen Wan, Jiann-Der Lee, "Three-Dimensional Topology Preserving Reduction on the 4-Subfields," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 12, pp. 1594-1605, Dec. 2002, doi:10.1109/TPAMI.2002.1114851
Usage of this product signifies your acceptance of the Terms of Use.