Buscar
Mostrando ítems 1-5 de 5
Ponencia
A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image
(Springer, 2015)
A design and implementation of a parallel algorithm for computing the Region-Adjacency Tree of a given segmentation of a 2D digital image is given. The technique is based on a suitable distributed use of the algorithm ...
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 ...
Ponencia
Labeling Color 2D Digital Images in Theoretical Near Logarithmic Time
(Springer, 2017)
A design of a parallel algorithm for labeling color flat zones (precisely, 4-connected components) of a gray-level or color 2D digital image is given. The technique is based in the construction of a particular Homological ...