Abstract
AbstractTopological representations of binary digital images usually take into consideration different adjacency types between colors. Within the cubical-voxel 3D binary image context, we design an algorithm for computing the isotopic model of an image, called (6, 26)-Homological Region Adjacency Tree ((6, 26)-Hom-Tree). This algorithm is based on a flexible graph scaffolding at the inter-voxel level called Homological Spanning Forest model (HSF). Hom-Trees are edge-weighted trees in which each node is a maximally connected set of constant-value voxels, which is interpreted as a subtree of the HSF. This representation integrates and relates the homological information (connected components, tunnels and cavities) of the maximally connected regions of constant color using 6-adjacency and 26-adjacency for black and white voxels, respectively (the criteria most commonly used for 3D images). The Euler-Poincaré numbers (which may as well be computed by counting the number of cells of each dimension on a cubical complex) and the connected component labeling of the foreground and background of a given image can also be straightforwardly computed from its Hom-Trees. Being $$I_D$$
I
D
a 3D binary well-composed image (where D is the set of black voxels), an almost fully parallel algorithm for constructing the Hom-Tree via HSF computation is implemented and tested here. If $$I_D$$
I
D
has $$m_1{\times } m_2{\times } m_3$$
m
1
×
m
2
×
m
3
voxels, the time complexity order of the reproducible algorithm is near $$O(\log (m_1{+}m_2{+}m_3))$$
O
(
log
(
m
1
+
m
2
+
m
3
)
)
, under the assumption that a processing element is available for each cubical voxel. Strategies for using the compressed information of the Hom-Tree representation to distinguish two topologically different images having the same homological information (Betti numbers) are discussed here. The topological discriminatory power of the Hom-Tree and the low time complexity order of the proposed implementation guarantee its usability within machine learning methods for the classification and comparison of natural 3D images.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference41 articles.
1. Hensel, F., Moor, M., Rieck, B.: A survey of topological machine learning methods. Front. Artif. Intell. 4, 52 (2021)
2. Pun, C.S., Lee, S.X., Xia, K.: Persistent-homology-based machine learning: a survey and a comparative study. Artif. Intell, Rev (2022)
3. Sanfeliu, A., Alquézar, R., Andrade, J., Climent, J., Serratosa, F., Vergés, J.: Graph-based representations and techniques for image processing and image analysis. Pattern Recognit. 35(3), 639–650 (2002)
4. Klette, R.: Cell complexes through time. In: Vision Geometry IX, SPIE, vol. 4117, pp. 134–145. (2000)
5. Pavlidis, T.: Structural pattern recognition. Springer-Verlag, New York (1977)