Fast circle detection using harmony search optimization

Erik Cuevas, Humberto Sossa, Valentín Osuna, Daniel Zaldivar, Marco Pérez-Cisneros

Producción científica: Capítulo del libro/informe/acta de congresoCapítulorevisión exhaustiva

Resumen

Automatic circle detection in digital images has received considerable attention over the last years. Recently, several robust circle detectors, based on evolutionary algorithms (EA), have been proposed. They have demonstrated to provide better results than those based on the Hough Transform. However, since EA-detectors usually need a large number of computationally expensive fitness evaluations before a satisfying result can be obtained; their use for real time has been questioned. In this work, a new algorithm based on the Harmony Search Optimization (HSO) is proposed to reduce the number of function evaluation in the circle detection process. In order to avoid the computation of the fitness value of several circle candidates, the algorithm estimates their values by considering the fitness values from previously calculated neighboring positions. As a result, the approach can substantially reduce the number of function evaluations preserving the good search capabilities of HSO. Experimental results from several 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.

Idioma originalInglés
Título de la publicación alojadaEVOLVE A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II
EditorialSpringer Verlag
Páginas313-325
Número de páginas13
ISBN (versión impresa)9783642315183
DOI
EstadoPublicada - 2013

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen175 ADVANCES
ISSN (versión impresa)2194-5357

Huella

Profundice en los temas de investigación de 'Fast circle detection using harmony search optimization'. En conjunto forman una huella única.

Citar esto