Multilevel thresholding segmentation based on harmony search optimization
dc.contributor | Oliva, D., Departamento de Ingeniería Del Software e Inteligencia Artificial, Facultad Informética, Universidad Complutense, 28040 Madrid ucm.es, Spain; Cuevas, E., Departamento de Ciencias Computacionales, Universidad de Guadalajara, CU-TONALA, Avenida Revolución 1500, C.P 44430, Guadalajara, JAL, Mexico; Pajares, G., Departamento de Ingeniería Del Software e Inteligencia Artificial, Facultad Informética, Universidad Complutense, 28040 Madrid ucm.es, Spain; Zaldivar, D., Departamento de Ciencias Computacionales, Universidad de Guadalajara, CU-TONALA, Avenida Revolución 1500, C.P 44430, Guadalajara, JAL, Mexico; Perez-Cisneros, M., Departamento de Ciencias Computacionales, Universidad de Guadalajara, CU-TONALA, Avenida Revolución 1500, C.P 44430, Guadalajara, JAL, Mexico | |
dc.creator | Oliva, D. | |
dc.creator | Cuevas, E. | |
dc.creator | Pajares, G. | |
dc.creator | Zaldivar, D. | |
dc.creator | Perez-Cisneros, M. | |
dc.date.accessioned | 2015-09-15T18:26:52Z | |
dc.date.accessioned | 2022-11-02T14:34:30Z | |
dc.date.available | 2015-09-15T18:26:52Z | |
dc.date.available | 2022-11-02T14:34:30Z | |
dc.date.created | 2015-09-15T18:26:52Z | |
dc.date.issued | 2013 | |
dc.identifier | http://hdl.handle.net/20.500.12104/42979 | |
dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-84887458727&partnerID=40&md5=4ebb934d7335cda782c7800c53a52ff8 | |
dc.identifier | 10.1155/2013/575414 | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/5000662 | |
dc.description.abstract | In this paper, a multilevel thresholding (MT) algorithm based on the harmony search algorithm (HSA) is introduced. HSA is an evolutionary method which is inspired in musicians improvising new harmonies while playing. Different to other evolutionary algorithms, HSA exhibits interesting search capabilities still keeping a low computational overhead. The proposed algorithm encodes random samples from a feasible search space inside the image histogram as candidate solutions, whereas their quality is evaluated considering the objective functions that are employed by the Otsu's or Kapur's methods. Guided by these objective values, the set of candidate solutions are evolved through the HSA operators until an optimal solution is found. Experimental results demonstrate the high performance of the proposed method for the segmentation of digital images. Zapotitlán 2013 Diego Oliva et al. | |
dc.relation | Scopus | |
dc.relation | WOS | |
dc.relation | Journal of Applied Mathematics | |
dc.relation | 2013 | |
dc.title | Multilevel thresholding segmentation based on harmony search optimization | |
dc.type | Article |