Cuckoo search with search strategies and proper objective function for brightness preserving image enhancement

被引：17

作者：

Dhal K.G. ^{[1
]}

Das S. ^{[2
]}

机构：

[1] Dept. of Computer Sc. and Application Midnapore College (Autonomous), Paschim Medinipur, West Bengal

[2] Dept. of Engg. and Technological Studies University of Kalyani, Nadia, Kalyani

来源：

Pattern Recognition and Image Analysis | 2017年 / 27卷 / 04期

关键词：

brightness preservation; cuckoo search; fractal dimension; histogram equalization; QILV; search strategies;

D O I：

10.1134/S1054661817040046

中图分类号：

学科分类号：

摘要：

Image enhancement can be formulated as an optimization problem where one parameterized transformation function is used for enhancement purpose. The proper enhancement significantly depends on two factors- fine tuning of the parameters of the corresponding parameterized transformation function and other one is the selection of a proper objective function. In this study a parameterized variant of histogram equalization (HE) has been used for enhancement purpose and to tune the parameters of that variant a modified cuckoo search (CS) with new global and local search strategies is employed. This paper also concentrates on the selection of a proper objective function to preserve the original brightness of the image. A new objective function has been developed by combining fractal dimension (FD) and quality index based on local variance (QILV). Visual analysis and experimental results prove that modified CS with search strategies outperforms the traditional and some other existing modified CS algorithms. Considering the image’s brightness preserving capability, the proposed objective function significantly outperforms other existing objective functions. © 2017, Pleiades Publishing, Ltd.

引用

页码：695 / 712

页数：17

共 58 条

[41]

Das S., Abraham A., Chakraborty U.K., Konar A., Differential evolution using a neighborhood-based mutation operator, IEEE Trans. Evolutionary Computat., 13, pp. 526-553, (2009)

[42]

Wang H., Cui Z., Sun H., Rahnamayan S., Yang X.S., Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism, Soft Computing, pp. 1-15, (2016)

[43]

Leandro C.S.D., Viviana C.M., A novel particle swarm optimization approach using Henon map and implicit filtering local search for economic load dispatch, Chaos, Solit. Fractals, 39, pp. 510-518, (2009)

[44]

Sheikholeslami R., Kaveh A., A survey of chaos embedded meta-heuristic algorithms, Int. J. Opt. Civil. Eng., 3, 4, pp. 617-633, (2013)

[45]

Coelho L.D.S., Mariani V.C., Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization, Expert Syst. Appl., 34, pp. 1905-1913, (2008)

[46]

Jordehi A.R., A chaotic-based big bang–big crunch algorithm for solving global optimisation problems, Neural Comput. Appl., 25, pp. 1329-1335, (2014)

[47]

Choi C., Lee J.J., Chaotic local search algorithm, Artif. Life Robotics, 2, pp. 41-47, (1998)

[48]

Bansal J.C., Singh P.K., Saraswat M., Verma A., Jadon S.S., Abraham A., Inertia weight strategies in particle swarm optimization, Proc 3rd World Congress on Nature and Biologically Inspired Computing, pp. 640-647, (2011)

[49]

Caponetto R., Fortuna L., Fazzino S., Xibilia M.G., Chaotic sequences to improve the performance of evolutionary algorithms, IEEE Trans. Evolut. Comput., 7, pp. 289-304, (2003)

[50]

Jamil M., Zepernick H.J., Lévy flights and global optimization, Bio-Inspired Comput., (2013)

← 1 2 3 4 5 6 →