SciELO - Scientific Electronic Library Online

 
vol.17 número4Transformada para imágenes basada en memorias asociativas Alfa-BetaSobre la eficiencia de detección de objetos subpixeleados con potencia de fondo estructurado que depende de hipótesis índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Computación y Sistemas

versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546

Resumen

CUEVAS, Erik  y  ORTEGA-SANCHEZ, Noé. Harmony Search Algorithm and its Use in Digital Image Processing. Comp. y Sist. [online]. 2013, vol.17, n.4, pp.543-560. ISSN 2007-9737.

Classical methods often face big difficulties in solving image processing problems when images contain noise and distortions. For such images, the use of optimization approaches has been extended. This paper explores application of the Harmony Search (HS) algorithm to digital image processing. HS is a meta-heuristic optimization algorithm inspired by musicians improvising new harmonies while performing. In this paper, we consider two tasks as examples: circle detection and motion estimation, both issues are approached as optimization problems. In such approach, circle detection uses a combination of three edge points as parameters to construct candidate circles. A matching function determines if such candidate circles are actually present in a given image. In motion estimation, the HS algorithm is used to find a motion vector that minimizes the sum of absolute differences between two consecutive images. Experimental results show that the generated solutions are able to properly solve the problems under consideration.

Palabras llave : Harmony search; circle detection; block matching; meta-heuristics algorithms; digital image processing.

        · resumen en Español     · texto en Español     · Español ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons