Methods for thinning connected components of an image differ in the size of support, type of connectivity preserved, degrees of parallelism and pipelining, and smoothness and fidelity to structure of the results. A unifying framework is presented, using image morphology, of all 4- and 8-connectivity-preserving (CP) transformations that use a 3 X 3 basis of support on binary images discretized on a square lattice. Two types of atomic CP transformations are defined: weak CP neither breaks nor joins components and strong CP additionally preserves the number of connected components. It is shown that out of thousands of possible 3 X 3 hit-miss structuring elements (SEs), in their most general form there are only four SEs (and their rotational isomorphs) for each of the two sets (4- and 8-connectivity) that satisfy strong CP for atomic operations. Simple symmetry properties exist between elements of each set, and duality relations exist between these sets of SEs under reversal of foreground/background and thinning/thickening operations. The atomic morphological operations, that use one SE, are intrinsically parallel and translationally invariant, and the best thinned skeletons are produced by sequences of operations that use multiple SEs in parallel. A subset of SEs that preserve both 4- and 8-connectivity and have a high degree of symmetry can be used in the most parallel fashion without breaking connectivity and produce very smooth skeletons. For thickening operations, foreground components either self-limit on convex or expand indefinitely. The self-limited convex hulls are formed either by horizontal and vertical lines, or by lines of slope +/- 1. Four types of boundary contours can result for thickening operations that expand indefinitely. Thickened text images result in a variety of typographically interesting forms.
[1]
Xinhua Zhuang,et al.
Image Analysis Using Mathematical Morphology
,
1987,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2]
Roland T. Chin,et al.
A one-pass thinning algorithm and its parallel implementation
,
1987,
Comput. Vis. Graph. Image Process..
[3]
Marcel J. E. Golay,et al.
Hexagonal Parallel Pattern Transformations
,
1969,
IEEE Transactions on Computers.
[4]
Azriel Rosenfeld,et al.
Connectivity in Digital Pictures
,
1970,
JACM.
[5]
Ching Y. Suen,et al.
A fast parallel algorithm for thinning digital patterns
,
1984,
CACM.
[6]
Petros Maragos,et al.
Tutorial on advances in morphological image processing and analysis (Invited Paper)
,
1987
.
[7]
Azriel Rosenfeld,et al.
Some Parallel Thinning Algorithms for Digital Pictures
,
1971,
JACM.
[8]
Richard W. Hall,et al.
Fast parallel thinning algorithms: parallel speed and connectivity preservation
,
1989,
CACM.
[9]
Azriel Rosenfeld,et al.
A Note on Thinning
,
1976,
IEEE Transactions on Systems, Man, and Cybernetics.
[10]
Jean Serra,et al.
Image Analysis and Mathematical Morphology
,
1983
.
[11]
Stefano Levialdi,et al.
Parallel thinning of binary pictures
,
1975
.
[12]
P. S. P. Wang,et al.
A Fast Serial and Parallel Thinning Algorithm
,
1986
.
[13]
Azriel Rosenfeld,et al.
Digital Picture Processing
,
1976
.
[14]
Ronald H. Perrott,et al.
An improved parallel thinning algorithm
,
1987,
CACM.
[15]
Patrick Shen-Pei Wang,et al.
A comment on “a fast parallel algorithm for thinning digital patterns”
,
1986,
CACM.
[16]
Petros Maragos,et al.
Morphological skeleton representation and coding of binary images
,
1984,
IEEE Trans. Acoust. Speech Signal Process..