Title: Binary picture thinning by an iterative parallel two-subcycle operation
Abstract: A thinning algorithm for digital binary pictures is presented. The algorithm repeats the removal of the deletable border points in parallel and the extraction of the final points. It is implemented as an iterative parallel two-subcycle operation. Consequently, the number of iterations required is about equal to the maximum width of the input figures. The algorithm erases the end points while the iteration number is smaller than a given threshold. Utilization of the final point condition makes the algorithm faster and the flexible deletion of end points produces a line pattern of good quality even for noisy figures.
Publication Year: 1987
Publication Date: 1987-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 45
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot