Performance analysis of chaotic lévy bat algorithm and chaotic cuckoo search algorithm for gray level image enhancement

21Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dark images can be enhanced in a controlled manner with the help of nature inspired metaheuristic algorithm. In this case image enhancement has been taken as a nonlinear optimization problem. Bat algorithm (BA) and Cuckoo Search (CS) algorithm is one of the most powerful metaheuristic algorithms. In this paper these two algorithms have been modified by chaotic sequence and lévy flight. In BA lévy flight with chaotic step size helps to do intensification. In CS algorithm the random walk has been done via chaotic sequence. Entropy and edge information has been used as objective function. From quantitative and visual analysis it is clear that chaotic lévy BA outperforms the chaotic CS algorithm.

Cite

CITATION STYLE

APA

Dhal, K. G., Quraishi, M. I., & Das, S. (2015). Performance analysis of chaotic lévy bat algorithm and chaotic cuckoo search algorithm for gray level image enhancement. In Advances in Intelligent Systems and Computing (Vol. 339, pp. 233–244). Springer Verlag. https://doi.org/10.1007/978-81-322-2250-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free