Study of parallel thinning algorithms

Three parallel thinning algorithms are studied. The analysis and comparison of the algorithms are based on the topological analysis, shapes of the skeletons, and processing time. A special labeling technique is used which can both save the memory space and improve the processing time in implementation of parallel algorithms on parallel computers. The analysis and comparison of the experimental results of these algorithms are outlined.<<ETX>>