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
Some Parallel Thinning Algorithms for Digital Pictures
Journal of the ACM (JACM)
A fast parallel algorithm for thinning digital patterns
Communications of the ACM
Digital Picture Processing
Parallel thinning with two-subiteration algorithms
Communications of the ACM
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
Optimally Small Operator Supports for Fully Parallel Thinning Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Evaluation of Parallel Thinning Algorithms for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Rotation Invariant Rule-Based Thinning Algorithm for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A comparative discussion of distance transforms and simple deformations in digital image processing
Machine Graphics & Vision International Journal
Binary Image Thinning Using Autowaves Generated by PCNN
Neural Processing Letters
Letters: A class of binary images thinning using two PCNNs
Neurocomputing
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
Journal of Mathematical Imaging and Vision
Sketch-based modeling of vascular systems: a first step towards interactive teaching of anatomy
Proceedings of the Seventh Sketch-Based Interfaces and Modeling Symposium
Skeleton simplification by key points identification
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
3D topological thinning by identifying non-simple voxels
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
New 2d parallel thinning algorithms based on critical kernels
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
TreeSketch: interactive procedural modeling of trees on a tablet
Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling
Matisse: painting 2D regions for modeling free-form shapes
SBM'08 Proceedings of the Fifth Eurographics conference on Sketch-Based Interfaces and Modeling
Optimal decision trees for local image processing algorithms
Pattern Recognition Letters
| Hi-index | 48.23 |
A recently published parallel thinning approach [4] is evaluated. An improvement is suggested to enable preservation of certain diagonal lines which are not preserved by this algorithm. A unified notion of what is meant by an iteration (or subiteration) and parallel speed is presented, and with regard to its parallel speed this algorithm is argued to be comparable to other two-subiteration algorithms. The parallel speed of this algorithm is compared experimentally to the original algorithm that it improves [12] and it is shown that, unlike execution time on a specific machine, parallel speed is not improved. Finally, a more complete connectivity analysis is given illustrating sufficient additional conditions for applying fully in parallel the basic thinning operator used in both algorithms while maintaining all image connectivity properties.