Published February 15, 2018
| Version v1
Publication
Labeling Color 2D Digital Images in Theoretical Near Logarithmic Time
Description
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 Spanning Forest (HSF) structure for encoding topological
information of any image.HSFis a pair of rooted trees connecting the image
elements at inter-pixel level without redundancy. In order to achieve a correct
color zone labeling, our proposal here is to correctly building a sub-
HSF structure for each image connected component, modifying an initial
HSF of the whole image. For validating the correctness of our algorithm,
an implementation in OCTAVE/MATLAB is written and its results are
checked. Several kinds of images are tested to compute the number of iterations
in which the theoretical computing time differs from the logarithm
of the width plus the height of an image. Finally, real images are to be computed
faster than random images using our approach.
Abstract
Ministerio de Economía y Competitividad TEC2016-77785-PAbstract
Ministerio de Economía y Competitividad MTM2016-81030-PAdditional details
Identifiers
- URL
- https://idus.us.es/handle//11441/70320
- URN
- urn:oai:idus.us.es:11441/70320