Journal
APPLIED SOFT COMPUTING
Volume 55, Issue -, Pages 503-522Publisher
ELSEVIER
DOI: 10.1016/j.asoc.2017.02.005
Keywords
Chaotic sequence; Minimum cross entropy; Tsallis entropy; Metaheuristic algorithms; Convergence rate
Ask authors/readers for more resources
This paper proposes an improved variant of Darwinian Particle Swarm Optimization algorithm based on chaotic functions. Most of the evolutionary algorithms faces the problem of getting trapped in local optima in its search for global optimum solutions. This is highly influenced by the use of random sequences by different operators in these algorithms along their run. The proposed algorithm replaces random sequences by chaotic sequences mitigating the problem of premature convergence. Experiments were conducted to investigate the efficiency of 10 defined chaotic maps and the best one was chosen. Performance of the proposed Chaotic Darwinian Particle Swarm Optimization (CDPSO) algorithm is compared with chaotic variants of optimization algorithms like Cuckoo Search, Harmony Search, Differential Evolution and Particle Swarm Optimization exploiting the chosen optimal chaotic map. Various histogram thresholding measures like minimum cross entropy and Tsallis entropy were used as objective functions and implemented for satellite image segmentation scenario. The experimental results are validated qualitatively and quantitatively by evaluating the mean, standard deviation of the fitness values, PSNR, MSE, SSIM and the total time required for the execution of each optimization algorithm. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available