An investigation into the skeletonization approach of Hilditch
Pattern Recognition
A comment on “a fast parallel algorithm for thinning digital patterns”
Communications of the ACM - The MIT Press scientific computation series
A comment on an investigation into the skeletonization approach of Hilditch
Pattern Recognition
Connectivity in Digital Pictures
Journal of the ACM (JACM)
Some Parallel Thinning Algorithms for Digital Pictures
Journal of the ACM (JACM)
A fast parallel algorithm for thinning digital patterns
Communications of the ACM
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
Identification of Fork Points on the Skeletons of Handwritten Chinese Characters
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
3D Object Recognition and Visualization on the Web
WI '01 Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
Segmentation and reconstruction of the lung volume in CT images
Proceedings of the 2005 ACM symposium on Applied computing
A system for processing handwritten bank checks automatically
Image and Vision Computing
A syntactic PR approach to Telugu handwritten character recognition
Proceeding of the workshop on Document Analysis and Recognition
| Hi-index | 14.98 |
A fast serial and parallel algorithm for thinning digital patterns is presented. The processing speed is faster than previous algorithms in that it reads pixels along the edge of the input pattern rather than all pixels in each iteration. Using this algorithm, an experiment is conducted and the patterns such as 'X', 'H', 'A', 'moving body', and 'leaf' are tested. The results show that this algorithm is faster, structure-preserving, and more flexible in that it can be done either sequentially or in parallel.