Buscar
Mostrando ítems 1-6 de 6
Artículo
Parallel connected-Component-Labeling based on homotopy trees
(Elsevier, 2020)
Taking advantage of the topological and isotopic properties of binary digital images, we present here anew algorithm for connected component labeling (CLL). A local-to-global treatment of the topologicalinformation within ...
Artículo
Searching high order invariants in computer imagery
(2012)
In this paper, we present a direct computational application of Homological Perturbation Theory (HPT, for short) to computer imagery. More precisely, the formulas of the A ∞–coalgebra maps Δ 2 and Δ 3 using the notion of ...
Capítulo de Libro
Decomposing cavities in digital volumes into products of cycles
(2009)
The homology of binary 3–dimensional digital images (digital volumes) provides concise algebraic description of their topology in terms of connected components, tunnels and cavities. Homology generators corresponding to ...
Ponencia
Building Hierarchical Tree Representations Using Homological-Based Tools
(Springer, 2021)
A new algorithm for computing the α-tree hierarchical repre sentation of a grey-scale digital image is presented here. The technique is based on an efficient simplified version of the Homological Spanning For est (HSF) ...
Ponencia
Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time
(Springer, 2019)
Connected component labeling (CCL) of binary images is one of the fundamental operations in real time applications. The adjacency tree (AdjT) of the connected components offers a region-based representation where each ...
Ponencia
On the Topological Disparity Characterization of Square-Pixel Binary Image Data by a Labeled Bipartite Graph
(Springer, 2022)
Given an nD digital image I based on cubical n-xel, to fully characterize the degree of internal topological dissimilarity existing in I when using different adjacency relations (mainly, comparing 2n or 2n −1 adjacency ...