Buscar
Mostrando ítems 1-5 de 5
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 ...
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
Parallel Image Processing Using a Pure Topological Framework
(Universidad de Extremadura, 2016)
Image processing is a fundamental operation in many real time applications, where lots of parallelism can be extracted. Segmenting the image into different connected components is the most known operations, but there ...
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 ...