Abstract

This paper presents an efficient randomized Hough transform algorithm for circle detection. It optimizes the methods for determining sample points and finding candidate circles. Due to these two optimizations, sampling validity is improved and many false circles are prevented from being regarded as candidate circles. Experimental results demonstrate that the proposed algorithm, which features a strong robustness and high resolution, can dramatically speed up circle detection as compared to other algorithms. It can also be applied to detect ellipses.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.