An algorithm for the detection of multiple concentric circles

11Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric circle detection with the HT is separated in two stages, one for the center detection and another for the radius determination. A new HT algorithm is proposed for the center detection stage which is simple, fast and robust. The proposed method selects groups of three points in each of the concentric circles to solve the circle equation and vote for the center. Geometrical constraints are imposed of the sets of three points to guarantee that they in fact belong to different concentric circles. In the radius detection stage the concentric circles are validated. The proposed algorithm was compared with several other HT circle detection techniques. Experimental results show the superiority and effectiveness of the proposed technique. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Silveira, M. (2005). An algorithm for the detection of multiple concentric circles. In Lecture Notes in Computer Science (Vol. 3523, pp. 271–278). Springer Verlag. https://doi.org/10.1007/11492542_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free