A new approach, called contour generating (CG) is proposed to reduce drastically the
running time for the parallel thinning algorithms on a sequential computer by providing an …

A perfectly parallel thinning algorithm (PPTA) is proposed. It can generate perfect skeletons,
which consist of end points, break points, and hole points only. Experimental results show …

Thinning is one of the most important techniques in the field of image processing. It is
applied to erode the image of an object layer-by-layer until a skeleton is left. Several …

A comparative evaluation of some fast parallel thinning algorithms for elongated shapes on
an overlapped shared memory multiprocessor architecture (OSMMA) is presented. The …

The skeleton of a digital figure can often be regarded as a convenient alternative to the
figure itself. It is useful both to diminish drastically the amount of data to be handled, and to …

It is well known that many proposed parallel thinning algorithms cannot satisfy all major
thinning requirements. In this paper we propose a new parallel thinning algorithm which can …

Abstract A parallel thinning algorithm [1](Holt etc.) is compared with algorithm [2](Rutovitz)
and [3](Zhang and Suen). Analyses and experiments show that the algorithm [1] is similar to …

A new parallel thinning algorithm and its parallel hardware implementation are proposed.
The algorithm requires only a single pass of parallel operations per iteration, and a small …

Thinning is a process of reducing the width of an image to just a single pixel. The resulting
thinned pattern is useful for topological analysis and classification for the shape of patterns …

A new parallel thinning algorithm for binary images is proposed. This algorithm employs
template matching to remove the edge points of an object shape in a binary image …