Abstract
Thinning algorithms have been studied widely in picture processing and pattern recognition because they offer a way of simplifying pictorial forms. Figure 9.1 illustrates a motivation for a thinning algorithm. The shaded pixels represent a quantization of a line drawing to be mapped back into a set of lines. In Sections 7.6 and 7.7, we have already discussed how the concept of thinness can be defined over a discrete grid. We shall use that analysis here as the basis for thinning algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Relevant Literature
Arcelli, C.; Cordella, L. P.; and Levialdi, S. “From Local Maxima to Connected Skeletons,” IEEE Trans. Pattern Analysis Machine Intelligence, PAMI-3 (1981), pp. 134–143.
Beun, M. “A flexible method for automatic reading of handwritten numerals,” Philips Technical Review, 33 (1973), Part I: pp. 89–101.
Beun, M. “A flexible method for automatic reading of handwritten numerals,” Philips Technical Review, 33 (1973) Part II: pp. 130–137.
Blum, H. “A Transformation for Extracting New Descriptions of Shape,” Symposium on Models for the Perception of Speech and Visual Form, M.I.T. Press, 1964.
Hilditch, C. J. “Linear Skeletons from Square Cupboards,” Machine Intelligence, 4 (1969), pp. 403–420.
Hattich, W.; Tropf, M.; and Winkler, G. “Combination of statistical and syntactical pattern recognition — applied to classification of unconstrained handwritten numerals,” Proc. Fourth Intern. Joint Conf. on Pattern Recognition, Kyoto, November 1978, pp. 786–788.
Montanari, U. “Continuous Skeletons from Digitized Images,” JACM, 16 (1969), pp. 534–549.
Naito, S.; Arakawa, H.; and Masuda, I. “Recognition of handprinted alphanumerics and symbols based on centroid lines,” Proc. Fourth Intern. Joint Conf. on Pattern Recognition, Kyoto, November 1978, pp. 797–801.
Pavlidis, T. “A Thinning Algorithm for Discrete Binary Images,” CGIP, 13 (1980), pp. 142–157.
Pfaltz, J. L. and Rosenfeld, A. “Computer Representation of Planar Regions by Their Skeletons,” CACM, 10 (1972) pp. 119–125.
Rosenfeld, A. “A Characterization of Parallel Thinning Algorithms,” Information and Control, 29 (1975), pp. 286–291.
Rosenfeld, A. and Pfaltz, J. L. “Sequential Operations in Digital Picture Processing,” JACM, 13 (1966), pp. 471–494.
Stefanelli, R. and Rosenfeld, A. “Some Parallel Thinning Algorithms for Digital Pictures,” JACM, 18 (1971), pp. 255–264.
Tamura, H. “A Comparison of Line Thinning Algorithms from Digital Geometry Viewpoint,” Proc. Fourth Intern. Joint Conf. on Pattern Recognition, Kyoto, November 1978, pp. 715–719.
Yokoi, S.; Toriwaki, J. I.; and Fukumura, T. “An Analysis of Topological Properties of Digitized Binary Pictures Using Local Features,” CGIP, 4 (1975), pp. 63–73.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Computer Science Press, Inc.
About this chapter
Cite this chapter
Pavlidis, T. (1982). Thinning Algorithms. In: Algorithms for Graphics and Image Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-93208-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-93208-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-93210-6
Online ISBN: 978-3-642-93208-3
eBook Packages: Springer Book Archive