New parallel algorithms for thinning of binary images

Prabir Bhattacharya; Xun Lu

doi:10.1117/12.45513

1 March 1991 New parallel algorithms for thinning of binary images

Prabir Bhattacharya, Xun Lu

Proceedings Volume 1468, Applications of Artificial Intelligence IX; (1991) https://doi.org/10.1117/12.45513
Event: Orlando '91, 1991, Orlando, FL, United States

Abstract

This paper describes two new parallel algorithms for thinning. Instead of a conventional 3 X 3 operator, a small cross window '+' with 5 or 9 points is employed in the implementation. The algorithms do not change the connectivity of the images. The experimental results show that the algorithms make the skeleton much closer to the medial axis, and make it more convenient to reconstruct the original pattern. Comparing with the other thinning methods, the new approach here gives advantages on saving the time and the window size when real world images are processed.

Citation Download Citation

Prabir Bhattacharya and Xun Lu "New parallel algorithms for thinning of binary images", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); https://doi.org/10.1117/12.45513

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available