An efficient distributed thinning algorithm

Abstract

We present a detailed solution for the problem of computing a skeleton of a digital image by a distributed system. The proposed algorithm uses domain decomposition of the image to be thinned rather than computing one pixel per processor. We will show that the rectangular tesselation with 4-subfields technique is especially appropriate for the distributed thinning. The theoretical model as well as a distributed implementation on a distributed memory MIMD architecture are presented.