Circle detection using Discrete Differential Evolution Optimization
Erik Cuevas, Daniel Zaldivar, Marco Perez, Marte Ramirez

TL;DR
This paper presents a fast, robust circle detection method using Discrete Differential Evolution optimization, capable of locating circles with sub-pixel accuracy in noisy and complex images, improving over previous methods.
Contribution
It introduces a novel DDE-based algorithm for circle detection that reduces search space and enhances accuracy and robustness compared to traditional approaches.
Findings
Achieves sub-pixel accuracy in circle detection
Demonstrates robustness in noisy and complex images
Offers faster detection with improved accuracy
Abstract
This paper introduces a circle detection method based on Differential Evolution (DE) optimization. Just as circle detection has been lately considered as a fundamental component for many computer vision algorithms, DE has evolved as a successful heuristic method for solving complex optimization problems, still keeping a simple structure and an easy implementation. It has also shown advantageous convergence properties and remarkable robustness. The detection process is considered similar to a combinational optimization problem. The algorithm uses the combination of three edge points as parameters to determine circles candidates in the scene yielding a reduction of the search space. The objective function determines if some circle candidates are actually present in the image. This paper focuses particularly on one DE-based algorithm known as the Discrete Differential Evolution (DDE),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Object Detection Techniques · Image Processing Techniques and Applications · Advanced Image and Video Retrieval Techniques
