Abstract
In this paper, we propose a new method for thinning digital gray-scale pictures by fitting piece-wise linear line to skelton. The method is not based on the point-wise gray-value information as Salari and Siy method, but based on an objective function robust for noise contaminated pictures. To optimize the function, we search the solution of the optimization problem with genetic algorithm. The procedure of the method is as follows. We allocate small regions so that they cover the neighborhood of skelton of object. In each small region, we extract a linear line which approximates the skelton in the small region, and represent the line by a couple of label numbers of points with nonzero gray values through which the line passes. A string is constructed by collecting all the label pairs. The fitness of a string is given by an objective function which is constructed so as to evaluate the proximity to skelton and to be robust for noise. After a genetic algorithm generates successive populations of strings, a skelton is given by the string with the greatest fitness.
Chapter PDF
Similar content being viewed by others
References
E.Salari and P.Siy:The Ridge-Seeking Method for Obtaining the Skelton of Digital Images. IEEE Trans. on Systems, Man, and Cybernetics, SMC-14, 524–528 (1984)
D.E.Goldberg:Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shioyama, T., Okumura, A., Aoki, Y. (1995). Genetic algorithm for thinning gray-scale images of characters. In: Braccini, C., DeFloriani, L., Vernazza, G. (eds) Image Analysis and Processing. ICIAP 1995. Lecture Notes in Computer Science, vol 974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60298-4_315
Download citation
DOI: https://doi.org/10.1007/3-540-60298-4_315
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60298-9
Online ISBN: 978-3-540-44787-0
eBook Packages: Springer Book Archive