Open AccessAlternative formulations to compute the binary shape Euler number
Author(s) -
Humberto Sossa Azuela Juan,
Rubio Espino Elsa,
Santiago Raúl,
López Alejandro,
Peña Ayala Alejandro,
Cuevas Jimenez Erik V.
Publication year - 2014
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2013.0076
Subject(s) - correctness , pixel , euler's formula , euler number (physics) , binary image , binary number , digital image , feature (linguistics) , image (mathematics) , backward euler method , computer science , euler equations , algorithm , digital topology , semi implicit euler method , mathematics , image processing , artificial intelligence , theoretical computer science , discrete mathematics , arithmetic , mathematical analysis , linguistics , philosophy , extension topology , general topology , topological space
The authors propose two equations based on the pixel geometry and connectivity properties, which can be used to compute, efficiently, the Euler number of a binary digital image with either thick or thin boundaries. Although computing this feature, the authors’ technique extracts the underlying topological information provided by the shape pixels of the given image. The correctness of computing the Euler number using the new equations is also established theoretically. The performance of the proposed method is compared against other available alternatives. Experimental results on a large image database demonstrate that the authors technique for computing the Euler number outperforms the earlier approaches significantly in terms of the number of basic arithmetic operations needed per pixel. Both equations are specialised only for 4‐connectivity cases.