Abstract
In this paper we suggest a methodology for detecting arcs and circles in a digitized image, by using as inputs the original image and the gradient image.
The algorithm is based on the geometric property that the centre of a circle or of an arc is the accumulation point of all the straight lines perpendicular to the circumference or arc.
The interest for this algorithm stems from the capability to recognize arcs and circles of unknown radii by a technique simple from the computational viewpoint, and whose results are not strongly affected by noise.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
— J. L. C. Sanz — "Special Issue on industrial machine vision and computer vision technology Part I and Part II", IEEE Trans. on PAMI vol. 10, N. 1–3 Jan–May 1988.
— A. Arbuschi, V. Cantoni, G. Musso — "Recognition and location of mechanical parts using the Hough tecnique", Digital image analysis, S. Levialdi 1984.
— D. H. Ballard & C. M. Brown — "Computer Vision", Prenctice-Hall, 1982.
— U.M. Landau — "Estimation of a Circular Arc Center and Its Radius", Computer Vision, Graphics, and I.P., 317–326, 1987.
— S.M. Thomas & Y.T. Chan — "A simple approach for the estimation of circular arc center and its radius", Computer Vision, Graphics, and I.P., 362–370, 1989.
— M. Nagao & T. Matsuyama — "A structural Analysis of Complex Aerial Photographs", Plenum Press, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Milano, A., Perotti, F., Serpico, S.B., Vernazza, G. (1989). Detection of arcs in workpiece images. In: Cantoni, V., Creutzburg, R., Levialdi, S., Wolf, G. (eds) Recent Issues in Pattern Analysis and Recognition. Lecture Notes in Computer Science, vol 399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51815-0_65
Download citation
DOI: https://doi.org/10.1007/3-540-51815-0_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51815-0
Online ISBN: 978-3-540-46815-8
eBook Packages: Springer Book Archive