Abstract: The classic connected components labelling algorithm requires two passes through an image. This paper presents an algorithm that allows the connected components to be analysed in a single ...
This repository contains the implementation of a new parallel shared-memory Connected-Components algorithm, named Afforest. The algorithm uses subgraph sampling for a fast approximation phase, after ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback