Winding and Euler numbers for 2D and 3D digital images

Abstract New algorithms for computing the Euler number of a 3D digital image S are given, based on smoothing the image to a differentiable object and applying theorems of differential geometry and algebraic topology. They run in O(n) time, where n is the number of object elements of S with neighbors not in S. The basic idea is general and easily extended to images defined by other means, such as a hierarchical data structure or a union of isothetic (hyper) rectangles.

[1]  Azriel Rosenfeld,et al.  Simple connectivity is not locally computable for connected 3D images , 1990, Comput. Vis. Graph. Image Process..

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

[3]  Berthold K. P. Horn.  Extended Gaussian images , 1984, Proceedings of the IEEE.

[4]  F. G. Peet,et al.  Surface Curvature as a Measure of Image Texture , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Sargur N. Srihari,et al.  Representation of Three-Dimensional Digital Images , 1981, CSUR.

[6]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

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

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

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

[10]  C. Dyer.  Computing the Euler number of an image from its quadtree , 1980 .

[11]  R. Haralick,et al.  The Topographic Primal Sketch , 1983 .

[12]  Akira Nakamura,et al.  On the Recognition of Properties of Three-Dimensional Pictures , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.