| Título |
Finding the Optimal Bit-Quad Patterns for Computing the Euler Number of 2D Binary Images Using Simulated Annealing |
| Tipo |
Congreso |
| Sub-tipo |
Memoria |
| Descripción |
13th Mexican Conference on Pattern Recognition, MCPR 2021
|
| Resumen |
This paper presents an automatic method for obtaining formulas to calculate the Euler number in 2D binary images. This problem is addressed as a combinatorial optimization problem, where specific bit-quad patterns are optimally combined. An algorithm based on simulated annealing is devised to find optimal expressions to compute the Euler number, considering 4- and 8-connectivity. The proposed approach found the complete family of expressions using three bit-quad patterns that correctly estimate the Euler number. Besides, another 58 new expressions are found that use more than three bit-quads. Hence, the proposed method can obtain automatically explainable formulas of the Euler number, and it can be potentially extended to other image representations. |
| Observaciones |
DOI 10.1007/978-3-030-77004-4_23
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Lugar |
Virtual, online |
| País |
Indefinido |
| No. de páginas |
240-250 |
| Vol. / Cap. |
v. 12725 LNCS |
| Inicio |
2021-06-23 |
| Fin |
2021-06-26 |
| ISBN/ISSN |
|
