Please use this identifier to cite or link to this item:
|Title:||Circle detection by Harmony Search Optimization|
|Abstract:||Automatic circle detection in digital images has received considerable attention over the last years in computer vision as several novel efforts aim for an optimal circle detector. This paper presents an algorithm for automatic detection of circular shapes considering the overall process as an optimization problem. The approach is based on the Harmony Search Algorithm (HSA), a derivative free meta-heuristic optimization algorithm inspired by musicians improvising new harmonies while playing. The algorithm uses the encoding of three points as candidate circles (harmonies) over the edge-only image. An objective function evaluates (harmony quality) if such candidate circles are actually present in the edge image. Guided by the values of this objective function, the set of encoded candidate circles are evolved using the HSA so that they can fit into the actual circles on the edge map of the image (optimal harmony). Experimental results from sev- eral tests on synthetic and natural images with a varying complexity range have been included to validate the efficiency of the proposed technique regarding accuracy, speed and robustness. � 2011 Springer Science+Business Media B.V.|
|Appears in Collections:||Producción científica UdeG|
Files in This Item:
There are no files associated with this item.
Items in RIUdeG are protected by copyright, with all rights reserved, unless otherwise indicated.