Thinning algorithms on rectangular, hexagonal, and triangular arrays

Authors:
E. S. Deutsch
Affiliations:
Univ. of Maryland, College Park
Venue:
Communications of the ACM
Year:
1972

Citing 1
Cited 25

Connectivity in Digital Pictures

Journal of the ACM (JACM)

A new approach to stroke and feature point extraction in Chinese character recognition

Pattern Recognition Letters
Pseudo one pass thinning algorithm

Pattern Recognition Letters
Thinning Methodologies-A Comprehensive Survey

IEEE Transactions on Pattern Analysis and Machine Intelligence
Veinerization: A New Shape Description for Flexible Skeletonization

IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast parallel algorithm for thinning digital patterns

Communications of the ACM
Recognition of Handwritten Cursive Arabic Characters

IEEE Transactions on Pattern Analysis and Machine Intelligence
On detecting all saddle points in 2D images

Pattern Recognition Letters
Characterization of digital circles in triangular grid

Pattern Recognition Letters
Distances with neighbourhood sequences in cubic and triangular grids

Pattern Recognition Letters
Preprocessing and postprocessing for skeleton-based fingerprint minutiae extraction

Pattern Recognition
Deriving the Medial Axis with geometrical arguments for planar shapes

Pattern Recognition Letters
Distance on a Hexagonal Grid

IEEE Transactions on Computers
An Analysis of Computational Cost in Image Processing: A Case Study

IEEE Transactions on Computers
A Parallel Picture Processing Machine

IEEE Transactions on Computers
Results on Hexagonal Tile Rewriting Grammars

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Collage of Hexagonal Arrays

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Thinning on cell complexes from polygonal tilings

Discrete Applied Mathematics
Neighborhood Sequences in the Diamond Grid --- Algorithms with Four Neighbors

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Thinning on quadratic, triangular, and hexagonal cell complexes

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Fast distance transformation on irregular two-dimensional grids

Pattern Recognition
Skeleton simplification by key points identification

MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
On topology preservation for hexagonal parallel thinning algorithms

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Calculating distance with neighborhood sequences in the hexagonal grid

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
A comparison among distances based on neighborhood sequences in regular grids

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Recognition of handprinted Kanji characters by the stroke matching method

Pattern Recognition Letters

Quantified Score

Hi-index	48.24

Visualization

Abstract

In this report three thinning algorithms are developed: one each for use with rectangular, hexagonal, and triangular arrays. The approach to the development of each algorithm is the same. Pictorial results produced by each of the algorithms are presented and the relative performances of the algorithms are compared. It is found that the algorithm operating with the triangular array is the most sensitive to image irregularities and noise, yet it will yield a thinned image with an overall reduced number of points. It is concluded that the algorithm operating in conjunction with the hexagonal array has features which strike a balance between those of the other two arrays.