On the computation of the Euler number of a binary object

In this paper a new method to obtain the Euler number of a binary object via its skeleton is presented. The number of terminal points (points with just one neighbor) and the number of three-edge-points (points with only three neighbors) in the graph are used to obtain this important invariant. As the proposed approach is inherently parallel, the resulting algorithm is very fast.

[1]  Azriel Rosenfeld,et al.  Well-Composed Sets , 1995, Comput. Vis. Image Underst..

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

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

[4]  S. Sengupta,et al.  Intelligent shape recognition for complex industrial tasks , 1988, IEEE Control Systems Magazine.

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

[6]  Azriel Rosenfeld,et al.  Picture Processing by Computer , 1969, CSUR.

[7]  Franco Chiavetta,et al.  Parallel computation of the Euler number via Connectivity Graph , 1993, Pattern Recognit. Lett..

[8]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[9]  Minghua Chen,et al.  A fast algorithm to calculate the Euler number for binary images , 1988, Pattern Recognit. Lett..

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

[11]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[12]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

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

[14]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.