March 1984 Volume 27 Number 3 | T. Y. ZHANG and C. Y. SUEN
This paper presents a fast parallel thinning algorithm for digital patterns, which aims to extract the "skeleton" of a pattern while preserving its endpoints and pixel connectivity. The algorithm consists of two subiterations: one deletes south-east boundary points and north-west corner points, and the other deletes north-west boundary points and south-east corner points. Each iteration is designed to minimize distortion and ensure efficient processing. The method is demonstrated to be effective through experimental results, showing that it can thin various digital patterns, including alphanumeric characters and ideographs, with minimal distortion. The algorithm is compared with a method by Stefanelli and Rosenfeld, and it is found to be 50% faster in execution time. The paper also includes a flowchart and examples of the algorithm's performance on different patterns, such as the Chinese character "䇫," the letter "B," and a digital "moving body." The results indicate that the proposed algorithm is efficient and produces skeletons that are comparable in quality to those from the reference method.This paper presents a fast parallel thinning algorithm for digital patterns, which aims to extract the "skeleton" of a pattern while preserving its endpoints and pixel connectivity. The algorithm consists of two subiterations: one deletes south-east boundary points and north-west corner points, and the other deletes north-west boundary points and south-east corner points. Each iteration is designed to minimize distortion and ensure efficient processing. The method is demonstrated to be effective through experimental results, showing that it can thin various digital patterns, including alphanumeric characters and ideographs, with minimal distortion. The algorithm is compared with a method by Stefanelli and Rosenfeld, and it is found to be 50% faster in execution time. The paper also includes a flowchart and examples of the algorithm's performance on different patterns, such as the Chinese character "䇫," the letter "B," and a digital "moving body." The results indicate that the proposed algorithm is efficient and produces skeletons that are comparable in quality to those from the reference method.