A topological characterization of thinning
Theoretical Computer Science
An improved parallel thinning algorithm
Communications of the ACM
Cellular logic image processing
Cellular logic image processing
A one-pass thinning algoruthm and its parallel implementation
Computer Vision, Graphics, and Image Processing
Discrete Applied Mathematics
Parallel thinning with two-subiteration algorithms
Communications of the ACM
Fast parallel thinning algorithms: parallel speed and connectivity preservation
Communications of the ACM
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Parallel shrinking algorithms using 2-subfields approaches
Computer Vision, Graphics, and Image Processing
Fast fully parallel thinning algorithms
CVGIP: Image Understanding
Some Parallel Thinning Algorithms for Digital Pictures
Journal of the ACM (JACM)
Multiprocessor Computer Architectures
Multiprocessor Computer Architectures
Digital Picture Processing
An Evaluation of Parallel Thinning Algorithms for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.14 |
Requirements for the support size and shape are investigated for the class of all adequate fully parallel thinning operators. Eleven pixel supports are shown to be the smallest possible supports, and the possible positions of the support pixels are shown to be well constrained. Constraints on support positions are demonstrated for operators with supports that are larger than optimal, and a sufficient test for connectivity preservation is reviewed. These results allow algorithm designers looking for small support operators to focus on a relatively small set of acceptable supports.