A Parallel Algorithm for Dilated Contour Extraction from Bilevel Images

TL;DR

This paper presents a parallelizable and efficient algorithm for extracting dilated contours from bilevel images, suitable for implementation on parallel computing systems, with a linear complexity for the remaining steps.

Contribution

The paper introduces a new parallel algorithm for dilated contour extraction from bilevel images, emphasizing its simplicity and efficiency.

Findings

Suitable for parallel implementation

Linear complexity in the latter part of the algorithm

Efficient contour generation from bilevel images

Abstract

We describe a simple, but efficient algorithm for the generation of dilated contours from bilevel images. The initial part of the contour extraction is explained to be a good candidate for parallel computer code generation. The remainder of the algorithm is of linear nature.