A Fast Parallel Thinning Algorithm for the Binary Image Skeletonization

Authors:
Weian Deng;S. Sitharama Iyengar;Nathan E. Brener
Affiliations:
Embarcadero Systems, Alameda, California, U.S.A.;Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana, U.S.A.;Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana, U.S.A.
Venue:
International Journal of High Performance Computing Applications
Year:
2000

Citing 9
Cited 4

A comment on “a fast parallel algorithm for thinning digital patterns”

Communications of the ACM - The MIT Press scientific computation series
An improved parallel thinning algorithm

Communications of the ACM
A one-pass thinning algoruthm and its parallel implementation

Computer Vision, Graphics, and Image Processing
Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
A new fast one-pass thinning algorithm and its parallel hardware implementation

Pattern Recognition Letters
A new one-pass parallel thinning algorithm for binary images

Pattern Recognition Letters
Optical character recognition using morphological attributes

Optical character recognition using morphological attributes
Some Parallel Thinning Algorithms for Digital Pictures

Journal of the ACM (JACM)
A fast parallel algorithm for thinning digital patterns

Communications of the ACM

Skeletonization based on error reduction

Pattern Recognition
Extraction of Line Feature in Binary Images

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Liveness detection for iris recognition using multispectral images

Pattern Recognition Letters
Coarse-to-fine skeleton extraction for high resolution 3D meshes

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.