Real, Pedro , Molina-Abril, Helena , Diaz-del-Rio, Fernando , BLANCO TREJO, SERGIO
No
Computer Analysis Of Images And Patterns, Caip 2019, Pt I
Proceedings Paper
Científica
01/01/2019
000558153800030
Given a 3D binary digital image I, we define and compute an edge-weighted tree, called Homological Region Tree (or Hom-Tree, for short). It coincides, as unweighted graph, with the classical Region Adjacency Tree of black 6-connected components (CCs) and white 26-connected components of I. In addition, we define the weight of an edge (R, S) as the number of tunnels that the CCs R and S "share". The Hom-Tree structure is still an isotopic invariant of I. Thus, it provides information about how the different homology groups interact between them, while preserving the duality of black and white CCs. An experimentation with a set of synthetic images showing different shapes and different complexity of connected component nesting is performed for numerically validating the method.
Binary 3D digital image; Region Adjacency Tree; Combinatorial topology; Homological Spanning Forest