Comparison of thinning algorithms on a parallel processor

A number of parallel algorithms for thinning elongated shapes are contrasted and compared on a Clip 4 parallel processor. These algorithms all work in rectangular tessellation and they thin elongated objects to lines one pixel thick while retaining their connectivity. Existing algorithms for use on binary pictures are considered first and new algorithms are proposed which produce more satisfactory results, but are more expensive in terms of speed and space requirements. Two methods of extending these algorithms to grey pictures are then considered. In one method, binary algorithms are used but are directed by the grey pixels; in the other the binary algorithms are generalized to the grey case. Both methods result in arcs which are not wholly determined by the original boundary of the object but lie along darker ridges. The former is faster and produces results which are easier to interpret, but the results from the latter contain more information.