A new chain coding mechanism for compression stimulated by a virtual environment of a predator-prey ecosystem

被引:11
作者
Dhou, Khaldoon [1 ]
机构
[1] Drury Univ, Breech Sch Business Adm, Springfield, MO 65802 USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2020年 / 102卷
关键词
Agent-based modeling; Chain code; Bi-level image; Compression; Arithmetic coding; Predator-prey ecosystem; PARTICLE SWARM OPTIMIZATION; ANT COLONY OPTIMIZATION; CODE COMPRESSION; NEURAL-NETWORK; IMAGE; SELECTION; ALGORITHM; LOSSLESS; SCHEME; JBIG2;
D O I
10.1016/j.future.2019.08.021
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, the researcher introduces a new chain coding mechanism that employs a predator-prey agent-based modeling simulation with some modifications and simplifications and uses it in compression. In the proposed method, an image is ultimately represented by a virtual world consisting of three agent types: wolves, sheep, and paths. While sheep and paths do not change their locations during the program execution, wolves search for sheep to prey on. With each step, a wolf can determine its path by choosing between seven pertinent moves depending on the encountered information. The algorithm keeps track of the wolves' initial locations and their movements and uses this as a new image representation. Additionally, the researcher introduces the 'Lengthy Advance Move,' the purpose of which is to group particular consecutive codes and further reduce the chain. This, in turn, allows the researcher to experiment with different variations of the algorithm. Finally, the researcher applies arithmetic coding on the series of movements for extra compression. The experimental results reveal that the current algorithm generates higher compression ratios than many standardized algorithms, including JBIG family algorithms. Most importantly, paired-sample t-tests reveal significant differences between the findings of the wolf-sheep predation algorithm and the other algorithms used as benchmarks for comparisons. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:650 / 669
页数:20
相关论文
共 118 条
[1]  
Abdmouleh M., 2012, Journal of Software Engineering and Applications, V5, P41
[2]   A new feature selection method to improve the document clustering using particle swarm optimization algorithm [J].
Abualigah, Laith Mohammad ;
Khader, Ahamad Tajudin ;
Hanandeh, Essam Said .
JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 25 :456-466
[3]  
Abusnaina A. A., 2014, RECENT ADV SOFT COMP, P183
[4]  
Abusnaina A.A., 2018, J INTELL SYST, DOI [10.1007/s11063-018-9846-0, DOI 10.1007/S11063-018-9846-0]
[5]   Supervised Training of Spiking Neural Network by Adapting the E-MWO Algorithm for Pattern Classification [J].
Abusnaina, Ahmed A. ;
Abdullah, Rosni ;
Kattan, Ali .
NEURAL PROCESSING LETTERS, 2019, 49 (02) :661-682
[6]   Training Neural Networks Using Salp Swarm Algorithm for Pattern Classification [J].
Abusnaina, Ahmed A. ;
Ahmad, Sobhi ;
Jarrar, Radi ;
Mafarja, Majdi .
ICFNDS'18: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND DISTRIBUTED SYSTEMS, 2018,
[7]   Handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading [J].
Ahmed, Bestoun S. ;
Gambardella, Luca M. ;
Afzal, Wasif ;
Zamli, Kamal Z. .
INFORMATION AND SOFTWARE TECHNOLOGY, 2017, 86 :20-36
[8]   Application of Particle Swarm Optimization to uniform and variable strength covering array construction [J].
Ahmed, Bestoun S. ;
Zamli, Kamal Z. ;
Lim, Chee Peng .
APPLIED SOFT COMPUTING, 2012, 12 (04) :1330-1347
[9]   A survey on the applications of artificial bee colony in signal, image, and video processing [J].
Akay, Bahriye ;
Karaboga, Dervis .
SIGNAL IMAGE AND VIDEO PROCESSING, 2015, 9 (04) :967-990
[10]  
Alkasassbeh M., 2013, INT J ADV SCI TECHNO, V55, P11