Robust Circle Detection Using Harmony Search

Abstract EN

Automatic circle detection is an important element of many image processing algorithms.

Traditionally the Hough transform has been used to find circular objects in images but more modern approaches that make use of heuristic optimisation techniques have been developed.

These are often used in large complex images where the presence of noise or limited computational resources make the Hough transform impractical.

Previous research on the use of the Harmony Search (HS) in circle detection showed that HS is an attractive alternative to many of the modern circle detectors based on heuristic optimisers like genetic algorithms and simulated annealing.

We propose improvements to this work that enables our algorithm to robustly find multiple circles in larger data sets and still work on realistic images that are heavily corrupted by noisy edges.