An innovative design of a hybrid chain coding algorithm for bi-level image compression using an agent-based modeling approach

被引:17
作者
Dhou, Khaldoon [1 ]
机构
[1] Drury Univ, Springfield, MO 65802 USA
关键词
Agent-based modeling; Lossless compression; Lossy compression; Chain coding; Bi-level image; PARTICLE SWARM OPTIMIZATION; KRILL HERD ALGORITHM; CODE COMPRESSION; LOSSLESS; STRATEGY;
D O I
10.1016/j.asoc.2019.03.024
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this article, the researcher introduces a hybrid chain code for shape encoding, as well as lossless and lossy bi-level image compression. The lossless and lossy mechanisms primarily depend on agent movements in a virtual world and are inspired by many agent-based models, including the Paths model, the Bacteria Food Hunt model, the Kermack-McKendrick model, and the Ant Colony model. These models influence the present technique in three main ways: the movements of agents in a virtual world, the directions of movements, and the paths where agents walk. The agent movements are designed, tracked, and analyzed to take advantage of the arithmetic coding algorithm used to compress the series of movements encountered by the agents in the system. For the lossless mechanism, seven movements are designed to capture all the possible directions of an agent and to provide more space savings after being encoded using the arithmetic coding method. The lossy mechanism incorporates the seven movements in the lossless algorithm along with extra modes, which allow certain agent movements to provide further reduction. Additionally, two extra movements that lead to more substitutions are employed in the lossless and lossy mechanisms. The empirical outcomes show that the present approach for bi-level image compression is robust and that compression ratios are much higher than those obtained by other methods, including JBIG1 and JBIG2, which are international standards in bi-level image compression. Additionally, a series of paired-samples t-tests reveals that the differences between the current algorithms' results and the outcomes from all the other approaches are statistically significant. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:94 / 110
页数:17
相关论文
共 106 条
[1]  
Abdmouleh M., 2012, Journal of Software Engineering and Applications, V5, P41
[2]  
Abualigah LM, 2019, EAI SPRINGER INNOVAT, P205, DOI 10.1007/978-3-319-96451-5_9
[3]   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
[4]   A novel hybridization strategy for krill herd algorithm applied to clustering techniques [J].
Abualigah, Laith Mohammad ;
Khader, Ahamad Tajudin ;
Hanandeh, Essam Said ;
Gandomi, Amir H. .
APPLIED SOFT COMPUTING, 2017, 60 :423-435
[5]   Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering [J].
Abualigah, Laith Mohammad ;
Khader, Ahamad Tajudin .
JOURNAL OF SUPERCOMPUTING, 2017, 73 (11) :4773-4795
[6]  
Abualigah LM, 2016, 2016 IEEE SYMPOSIUM ON COMPUTER APPLICATIONS & INDUSTRIAL ELECTRONICS (ISCAIE), P67, DOI 10.1109/ISCAIE.2016.7575039
[7]   Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm [J].
Ahmed, Bestoun S. ;
Abdulsamad, Taib Sh. ;
Potrus, Moayad Y. .
INFORMATION AND SOFTWARE TECHNOLOGY, 2015, 66 :13-29
[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]   Feedback and Surround Modulated Boundary Detection [J].
Akbarinia, Arash ;
Alejandro Parraga, C. .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2018, 126 (12) :1367-1380
[10]   High-speed all-optical Haar wavelet transform for real-time image compression [J].
Alemohammad, Milad ;
Stroud, Jasper R. ;
Bosworth, Bryan T. ;
Foster, Mark A. .
OPTICS EXPRESS, 2017, 25 (09) :9802-9811