Efficient Computation of the Euler Number of a 2-D Binary Image

• Published in: Advances in Computational Intelligence pp. 401 - 413
• Main Authors: Sossa-Azuela, Juan Humberto, Carreón-Torres, Ángel A., Santiago-Montero, Raúl, Bribiesca-Correa, Ernesto, Petrilli-Barceló, Alberto
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 9783319624334; 3319624334
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-62434-1_33

A new method to compute the Euler number of a 2-D binary image is described in this paper. The method employs three comparisons unlike other proposals that utilize more comparisons. We present two variations, one useful for the case of images containing only 4-connected objects and one useful in the case of 8-connected objects. To numerically validate our method, we firstly apply it to a set of very simple examples; to demonstrate its applicability, we test it next with a set of images of different sizes and object complexities. To show competitiveness of our method against other proposals, we compare it in terms of processing times with some of the state-of-the-art-formulations reported in literature.