Some Parallel Thinning Algorithms for Digital Pictures
Journal of the ACM (JACM)
A fast parallel algorithm for thinning digital patterns
Communications of the ACM
A thinning algorithm by contour generation
Communications of the ACM
Parallel thinning with two-subiteration algorithms
Communications of the ACM
Fast parallel thinning algorithms: parallel speed and connectivity preservation
Communications of the ACM
A Fast and Flexible Thinning Algorithm
IEEE Transactions on Computers
A parallel graytone thinning algorithm (PGTA)
Pattern Recognition Letters
A flexible thinning algorithm allowing parallel, sequential, and distributed application
ACM Transactions on Mathematical Software (TOMS)
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast Parallel Thinning Algorithm for the Binary Image Skeletonization
International Journal of High Performance Computing Applications
The multiresolution gradient vector field skeleton
Pattern Recognition
Triangle refinement in a constrained Delaunay triangulation skeleton
Pattern Recognition
| Hi-index | 0.05 |
A fast parallel thinning algorithm for digital patterns is presented. This algorithm is an improved version of the algorithms introduced by Zhang and Suen [5] and Stefanelli and Rosenfeld [3]. An experiment using an Apple II and an Epson printer was conducted. The results show that the improved algorithm overcomes some of the disadvantages found in [5] by preserving necessary and essential structures for certain patterns which should not be deleted and maintains very fast speed, from about 1.5 to 2.3 times faster than the four-step and two-step methods described in [3] although the resulting skeletons look basically the same.