Ordinary and directed combinatorial homotopy, applied to image analysic and concurrency

Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore mathematical models representing images, or directed images, or concurrent processes.

An image, represented by a metric space $X$, can be explored at a variable resolution $\epsilon > 0$, by equipping it with a structure $t_\epsilon X$ of simplicial complex depending on $\epsilon $; this complex can be further analysed by homotopy groups $\pi_n^\epsilon(X) = \pi_n(t_\epsilon X)$ and homology groups $H_n^\epsilon(X) = H_n(t_\epsilon X)$. Loosely speaking, these objects detect singularities which can be captured by an $n$-dimensional grid, with edges bound by $\epsilon$; this works equally well for continuous or discrete regions of euclidean spaces.

Similarly, a directed image, represented by an “asymmetric metric space,” produces a family of directed simplicial complexes $s_\epsilon X$ and can be explored by the fundamental n-category ${\uparrow}\Pi_n^\epsilon (X)$ of the latter. The same directed tools can be applied to combinatorial models of concurrent automata, like Chu-spaces.

Keywords

image processing, concurrent processes, metric, quasi-pseudo-metric, simplicial complex, graph theory, homotopy groups, homology groups, digital topology, mathematical morphology

2010 Mathematics Subject Classification

05C38, 54E15, 54E35, 54Gxx, 55Nxx, 55Q05, 55U10, 68Q85, 68U10

Full Text (PDF format)

Published 1 January 2003