Abstract
A Hough-like prediction/correction algorithm for ellipse detection is proposed. After the estimation of the five parameters of ellipse (a,b,c,r,θ) by a given condition, the best set of parameters can be obtained by a one-dimensional Hough-like accumulation process. Not only are a fast processing time and a small memory storage achieved, but the accuracy is also improved. The preliminary results show the effectiveness of the proposed algorithm for ellipse detection.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Duda, R O and Hart, P E (1972). Use of the Hough transformation to detect lines and curves in pictures. Commun. ACM 15(1), 11–15.
Davies, E R (1989). Finding ellipses using the generalised Hough transform. Pattern Recognition Letters 9, 87–96.
Leavers, V F (1990). Active Intelligent vision Using the Dynamic Generalized Hough Transform. Proc. British Machine Vision Conference, 49–54.
Tsuji, S and Matsumoto, F (1978). Detection of ellipses by a modified Hough transform. IEEE Trans. Computers 27, 777–781.
Tsukune, H and Goto, K (1983). Extracting elliptical figures from an edge vector field. Proc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, Washington, 138–141.
Yip, R K K and Tarn, P K S (1990). Modification of Hough transform for circles and ellipses detection. Proc. IASTED Int. Symposium Robotics and Manufacturing, Santa Barbara, USA, 154–157.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, L.T.S., Lam, W.C.Y., Leung, D.N.K. (1993). A Hough-like prediction/correction approach for ellipse detection. In: Chetverikov, D., Kropatsch, W.G. (eds) Computer Analysis of Images and Patterns. CAIP 1993. Lecture Notes in Computer Science, vol 719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57233-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-57233-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57233-6
Online ISBN: 978-3-540-47980-2
eBook Packages: Springer Book Archive