论文信息 - Index of a point of 3-D digital binary image and algorithm for computing its Euler characteristic

Index of a point of 3-D digital binary image and algorithm for computing its Euler characteristic

In this work a concept of index of a point of a 3-D (26, 6) digital image is defined. Basing on this concept a new characterization of the so-called simple points [1] as well as an algorithm for computing Euler characteristics of 3-D (26, 6) digital pictures is proposed.

Alexander I. Bykov | Leonid G. Zerkalov | Mario A. Rodrı́guez Pineda

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

[2] Hanspeter Bieri,et al. Algorithms for the euler characteristic and related additive functionals of digital objects , 1984, Comput. Vis. Graph. Image Process..

[3] Alexander I. Bykov,et al. New connected components algorithms and invariant transformations of digital images , 1998, Pattern Recognit..

[4] Alexander I. Bykov,et al. Algorithms for homotopy classification of binary images , 1996, Pattern Recognit..

[5] Stephen B. Gray,et al. Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[6] Hanspeter Bieri,et al. Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation , 1987, Comput. Vis. Graph. Image Process..

[7] Frans C. A. Groen,et al. Three-Dimensional Skeletonization: Principle and Algorithm , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[9] D. Morgenthaler. Three-Dimensional Digital Topology: The Genus. , 1980 .

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

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