0000000001215992

AUTHOR

Rosalia Renda

showing 1 related works from this author

A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES

1992

In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.

Connected componentDegree (graph theory)Artificial IntelligenceDiscrete spaceBinary imageVisibility (geometry)Parallel algorithmComputer Vision and Pattern RecognitionTime complexityAlgorithmSoftwareMathematicsCylindrical algebraic decompositionInternational Journal of Pattern Recognition and Artificial Intelligence
researchProduct