scispace - formally typeset
D

Daniel Zaldivar

Researcher at University of Guadalajara

Publications -  137
Citations -  3451

Daniel Zaldivar is an academic researcher from University of Guadalajara. The author has contributed to research in topics: Optimization problem & Image segmentation. The author has an hindex of 29, co-authored 131 publications receiving 2691 citations. Previous affiliations of Daniel Zaldivar include Free University of Berlin & Complutense University of Madrid.

Papers
More filters
Journal ArticleDOI

A swarm optimization algorithm inspired in the behavior of the social-spider

TL;DR: A novel swarm algorithm called the Social Spider Optimization (SSO) is proposed for solving optimization tasks based on the simulation of cooperative behavior of social-spiders, and is compared to other well-known evolutionary methods.

Kalman filter for vision tracking

TL;DR: The capacity of the Kalman Filter to allow small occlusions and also the use of the extended Kalman filter (EKF) to model complex movements of objects are considered.
Journal ArticleDOI

A better balance in metaheuristic algorithms: Does it exist?

TL;DR: This paper presents an experimental analysis that quantitatively evaluates the balance between exploration and exploitation of several of the most important and better-known metaheuristic algorithms.
Journal ArticleDOI

A novel multi-threshold segmentation approach based on differential evolution optimization

TL;DR: A novel automatic image multi-threshold approach based on differential evolution optimization is proposed that is not only computationally efficient but also does not require prior assumptions whatsoever about the image.
Journal ArticleDOI

Multilevel Thresholding Segmentation Based on Harmony Search Optimization

TL;DR: A multilevel thresholding (MT) algorithm based on the harmony search algorithm (HSA) is introduced, an evolutionary method which is inspired in musicians improvising new harmonies while playing and exhibits interesting search capabilities still keeping a low computational overhead.