Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
International Journal of High Performance Computing Applications
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Web of Science (2)
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Deng, W.
Right arrow Articles by Brener, N. E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

A Fast Parallel Thinning Algorithm for the Binary Image Skeletonization

Weian Deng

Embarcadero Systems, Alameda, California, U.S.A.

S. Sitharama Iyengar

Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana, U.S.A.

Nathan E. Brener

Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana, U.S.A.

This paper investigates the skeletonization problem using parallel thinning techniques and proposes a new one-pass parallel asymmetric thinning algorithm (OPATA8). Wu and Tsai presented a one-pass parallel asymmetric thinning algorithm (OPATA4) that implemented 4-distance, or city block distance, skeletonization. However, city block distance is not a good approximation of Euclidean distance. By applying 8-distance, or chessboard distance, this new algorithm improves not only the quality of the resulting skeletons but also the efficiency of the computation. This algorithm uses 18 patterns. The algorithm has been implemented, and has been compared to both algorithm OPATA4 and Zhang and Suen’s two-pass parallel thinning algorithm. The results show that the proposed OPATA8 has good noise resistance, perfectly 8-connected skeleton output, and a faster speed without serious erosion.

International Journal of High Performance Computing Applications, Vol. 14, No. 1, 65-81 (2000)
DOI: 10.1177/109434200001400105
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?