by Molina-Abril, H, Real, P, Nakamura, A and Klette, R
Abstract:
The paper analyzes the connectivity information (more precisely, numbers of tunnels and their homological (co)cycle classification) of fractal polyhedra. Homology chain contractions and its combinatorial counterparts, called homological spanning forest (HSF), are presented here as an useful topological tool, which codifies such information and provides an hierarchical directed graph-based representation of the initial polyhedra. The Menger sponge and the Sierpiński pyramid are presented as examples of these computational algebraic topological techniques and results focussing on the number of tunnels for any level of recursion are given. Experiments, performed on synthetic and real image data, demonstrate the applicability of the obtained results. The techniques introduced here are tailored to self-similar discrete sets and exploit homology notions from a representational point of view. Nevertheless, the underlying concepts apply to general cell complexes and digital images and are suitable for progressing in the computation of advanced algebraic topological information of 3-dimensional objects.
Reference:
Connectivity calculus of fractal polyhedrons (Molina-Abril, H, Real, P, Nakamura, A and Klette, R), In Pattern Recognition, Elsevier Ltd, volume 48, 2015.
Bibtex Entry:
@article{molina-abril2015connectivitypolyhedrons,
author = "Molina-Abril, H and Real, P and Nakamura, A and Klette, R",
journal = "Pattern Recognition",
month = "Apr",
pages = "1146--1156",
publisher = "Elsevier Ltd",
title = "Connectivity calculus of fractal polyhedrons",
volume = "48",
year = "2015",
abstract = "The paper analyzes the connectivity information (more precisely, numbers of tunnels and their homological (co)cycle classification) of fractal polyhedra. Homology chain contractions and its combinatorial counterparts, called homological spanning forest (HSF), are presented here as an useful topological tool, which codifies such information and provides an hierarchical directed graph-based representation of the initial polyhedra. The Menger sponge and the Sierpiński pyramid are presented as examples of these computational algebraic topological techniques and results focussing on the number of tunnels for any level of recursion are given. Experiments, performed on synthetic and real image data, demonstrate the applicability of the obtained results. The techniques introduced here are tailored to self-similar discrete sets and exploit homology notions from a representational point of view. Nevertheless, the underlying concepts apply to general cell complexes and digital images and are suitable for progressing in the computation of advanced algebraic topological information of 3-dimensional objects.",
doi = "10.1016/j.patcog.2014.05.016",
issn = "0031-3203",
issue = "4",
keyword = "Betti number",
keyword = "Connectivity",
keyword = "Cycles",
keyword = "Directed graphs",
keyword = "Fractal set",
keyword = "Menger sponge",
keyword = "Sierpiński pyramid",
keyword = "Topological analysis",
keyword = "Tunnels",
language = "eng",
pii = "S0031320314002167",
day = "1",
}