2021
DOI: 10.1007/978-3-030-77004-4_23
|View full text |Cite
|
Sign up to set email alerts
|

Finding the Optimal Bit-Quad Patterns for Computing the Euler Number of 2D Binary Images Using Simulated Annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Furthermore, to obtain the Euler number, Gomez [21] and Sossa [22] presented alternative formulas by use of bit-quads. Similar to the C-BQ algorithm, there are pixels that are accessed repeatedly upon implementation, and the proposed algorithm can be improved by using the strategies of state transition and multi-row scanning.…”
Section: Strategy Of Multi-row Scanningmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, to obtain the Euler number, Gomez [21] and Sossa [22] presented alternative formulas by use of bit-quads. Similar to the C-BQ algorithm, there are pixels that are accessed repeatedly upon implementation, and the proposed algorithm can be improved by using the strategies of state transition and multi-row scanning.…”
Section: Strategy Of Multi-row Scanningmentioning
confidence: 99%
“…For example, taking advantages of the skeleton, the perimeter/contact perimeter and the special contour pixels of the image, we can compute the Euler number in different ways. (3) Algorithms that compute the Euler number by counting specific blocks/patterns in the image [17][18][19][20][21][22][23][24][25]. In these algorithms, specific patterns with 2 × 2 pixels and consecutive foreground pixel blocks in the same row in the image, called runs, can be employed for calculating the Euler number.…”
Section: Introductionmentioning
confidence: 99%