A Modified Grasshopper Optimization Algorithm Combined with CNN for Content Based Image Retrieval

Document Type : Original Article

Authors

Department of Electrical and Computer Engineering, University of Birjand, Birjand, Iran

Abstract

Nowadays, with huge progress in digital imaging, new image processing methods are needed to manage digital images stored on disks. Image retrieval has been one of the most challengeable fields in digital image processing which means searching in a big database in order to represent similar images to the query image. Although many efficient researches have been performed for this topic so far, there is a semantic gap between human concept and features extracted from the images and it has become an important problem which decreases retrieval precision. In this paper, a convolutional neural network (CNN) is used to extract deep and high-level features from the images. Next, an optimization problem is defined in order to model the retrieval system. Heuristic algorithms such as genetic algorithm (GA) and particle swarm optimization (PSO) have shown an effective role in solving the complex problems. A recent introduced heuristic algorithm is Grasshopper Optimization Algorithm (GOA) which has been proved to be able to solve difficult optimization problems. So, a new search method, modified grasshopper optimization algorithm (MGOA) is proposed to solve modeled problem and to retrieve similar images efficiently, despite of total search in database. Experimental results showed that the proposed system named CNN-MGOA achieves superior accuracy compared to traditional methods.

Keywords

Main Subjects


1. Contreras, I., Hub location problems, in Location science, G.
Laporte, S. Nickel, and F. Saldanha da Gama, Editors. 2015,
Springer International Publishing: Cham. 311-344.
2. Campbell, J.F., "Integer programming formulations of discrete
hub location problems", European Journal of Operational
Research,  Vol. 72, No. 2, (1994), 387-405.
3. Karimi, H. and Bashiri, M., "Hub covering location problems
with different coverage types", Scientia Iranica,  Vol. 18, No. 6,
(2011), 1571-1578.
4. Hwang, Y.H. and Lee, Y.H., "Uncapacitated single allocation phub

maximal covering problem", Computers & Industrial
Engineering,  Vol. 63, No. 2, (2012), 382-389.
5. Jabalameli, M.S., Barzinpour, F., Saboury, A. and GhaffariNasab,
N.,
"A
simulated
annealing-based
heuristic
for
the
single

allocation

maximal covering hub location problem",
International Journal of Metaheuristics,  Vol. 2, No. 1, (2012),
15-37.
6. Ebrahimi-zade, A., Sadegheih, A. and Lotfi, M.M., "A modified
nsga-ii solution for a new multi-objective hub maximal covering
problem under uncertain shipments", Journal of Industrial
Engineering International,  Vol. 10, No. 4, (2014), 185-197.
7. Pasandideh, S.H.R., Niaki, S.T.A. and Sheikhi, M., "A biobjective

hub maximal covering location problem considering
time-dependent reliability and the second type of coverage",
International Journal of Management Science and
Engineering Management,  Vol. 11, No. 4, (2015), 195-202.
8. Bashiri, M. and Rezanezhad, M., "A reliable multi-objective phub
covering
location
problem
considering
of
hubs
capabilities",

International

Journal of Engineering-Transactions B:
Applications,  Vol. 28, No. 5, (2015), 717-729.
9. Karimi, H., Bashiri, M. and Nickel, S., "Capacitated single
allocation p-hub covering problem in multi-modal network using
tabu search", International Journal of EngineeringTransactions
C:
Aspects,

Vol.
29,
No.
6,
(2016),
797-808.

10. Ebrahimi-zade, A., Sadegheih, A. and Lotfi, M.M., "Fuzzy
multi-objective linear programming for a stochastic hub
maximal covering problem with uncertain shipments",
International Journal of Industrial and Systems Engineering,
Vol. 23, No. 4, (2016), 482-499.
11. Janković, O. and Stanimirović, Z., "A general variable
neighborhood search for solving the uncapacitated r-allocation
p-hub maximal covering problem", Electronic Notes in Discrete
Mathematics,  Vol. 58, (2017), 23-30.
12. Janković, O., Mišković, S., Stanimirović, Z. and Todosijević, R.,
"Novel formulations and vns-based heuristics for single and
multiple allocation p-hub maximal covering problems", Annals
of Operations Research,  Vol. 259, No. 1-2, (2017), 191-216.
13. Madani, S.R., Shahandeh Nookabadi, A. and Hejazi, S.R., "A biobjective,

reliable single allocation p-hub maximal covering
location problem: Mathematical formulation and solution
approach", Journal of Air Transport Management,  Vol. 68,
(2018), 118-136.
14. Gelareh, S., "Hub location models in public transportation
planning", Kaiserslautern University of Technology, Ph.D,
Thesis  (2008),  
15. Ebrahimi-zade, A., Hosseini-Nasab, H., zare-mehrjerdi, Y. and
Zahmatkesh, A., "Multi-period hub set covering problems with
flexible radius: A modified genetic solution", Applied
Mathematical Modelling,  Vol. 40, No. 4, (2016), 2968-2982.
16. Campbell, J.F. and O'Kelly, M.E., "Twenty-five years of hub
location research", Transportation Science,  Vol. 46, No. 2,
(2012), 153-169.
17. Balaman, Ş.Y., Matopoulos, A., Wright, D.G. and Scott, J.,
"Integrated optimization of sustainable supply chains and
transportation networks for multi technology bio-based
production: A decision support system based on fuzzy εconstraint
method",
Journal
of
Cleaner
Production,

Vol.
172,

(2018),
2594-2617.

18. Yu, H. and Solvang, W.D., "An improved multi-objective
programming with augmented ε-constraint method for hazardous
waste location-routing problems", International Journal of
Environmental Research and Public Health,  Vol. 13, No. 6,
(2016), DOI: 10.3390/ijerph13060548.
19. Emami, S., Moslehi, G. and Sabbagh, M., "A benders
decomposition approach for order acceptance and scheduling
problem: A robust optimization approach", Computational and
Applied Mathematics,  Vol. 36, No. 4, (2017), 1471-1515.
20. Saharidis , K.D., Minoux , M. and Ierapetritou , G.,
"Accelerating benders method using covering cut bundle
generation", International Transactions in Operational
Research,  Vol. 17, No. 2, (2010), 221-237.
21. O'Kelly, M.E., "A quadratic integer program for the location of
interacting hub facilities", European Journal of Operational
Research,  Vol. 32, No. 3, (1987), 393-404.
22. Alumur, S.A., Nickel, S., Saldanha-da-Gama, F. and Seçerdin,
Y., "Multi-period hub network design problems with modular
capacities", Annals of Operations Research,  Vol. 246, No. 1,
(2016), 289-312.
23. Gelareh, S., Neamatian Monemi, R. and Nickel, S., "Multiperiod
hub
location
problems
in
transportation",
Transportation

Research
Part
E:
Logistics
and
Transportation
Review,

Vol.

75,
(2015),
67-94.

24. Silva, M.R. and Cunha, C.B., "A tabu search heuristic for the
uncapacitated single allocation p-hub maximal covering
problem", European Journal of Operational Research,  Vol.
262, No. 3, (2017), 954-965.