Claim Missing Document
Check
Articles

Found 4 Documents
Search

LICA-CS: Efficient Lossless Image Compression Algorithm via Column Subtraction Model Al Qerom, Mahmoud; Otair, Mohammad; Meziane, Farid; AbdulRahman, Sawsan; Alzubi, Maen
Journal of Robotics and Control (JRC) Vol 5, No 5 (2024)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v5i5.21834

Abstract

Driven by the unprecedented amount of data generated in the last few decades, data storage and communication are becoming more challenging. Although many approaches in data compression have been developed to alleviate these challenges, more efforts are still needed, especially for lossless image compression, which is a promising technique when critical information loss is not allowed. In this paper, we propose a new algorithm called the Lossless Image Compression Algorithm using a Column Subtraction model (LICA-CS). LICA-CS is efficient, low in complexity, decreases the image bit-depth, and enhances state-of-the-art performance. LICA-CS first implements a color transformation method as a pre-processing phase, which strategically minimizes inter-channel correlations to optimize compression outcomes. After that, a novel subtraction method was developed to compress the image data column-wise. We tackle the similarity and proximity of pixel values within adjacent columns, which offers a distinct advantage in reducing image size observing a significant size reduction of 71%. This is achieved through the subtraction of neighboring columns. The conducted experiments on colored images show that LICA-CS outperforms existing algorithms in terms of compression rate. Moreover, our method exhibited remarkable enhancements in execution time, with compression and decompression processes averaging 1.93 seconds. LICA-CS advances the state-of-the-art in lossless image compression, promising enhanced efficiency and effectiveness in image compression technologies.
LICA-CS: Efficient Lossless Image Compression Algorithm via Column Subtraction Model Al Qerom, Mahmoud; Otair, Mohammad; Meziane, Farid; AbdulRahman, Sawsan; Alzubi, Maen
Journal of Robotics and Control (JRC) Vol. 5 No. 5 (2024)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v5i5.21834

Abstract

Driven by the unprecedented amount of data generated in the last few decades, data storage and communication are becoming more challenging. Although many approaches in data compression have been developed to alleviate these challenges, more efforts are still needed, especially for lossless image compression, which is a promising technique when critical information loss is not allowed. In this paper, we propose a new algorithm called the Lossless Image Compression Algorithm using a Column Subtraction model (LICA-CS). LICA-CS is efficient, low in complexity, decreases the image bit-depth, and enhances state-of-the-art performance. LICA-CS first implements a color transformation method as a pre-processing phase, which strategically minimizes inter-channel correlations to optimize compression outcomes. After that, a novel subtraction method was developed to compress the image data column-wise. We tackle the similarity and proximity of pixel values within adjacent columns, which offers a distinct advantage in reducing image size observing a significant size reduction of 71%. This is achieved through the subtraction of neighboring columns. The conducted experiments on colored images show that LICA-CS outperforms existing algorithms in terms of compression rate. Moreover, our method exhibited remarkable enhancements in execution time, with compression and decompression processes averaging 1.93 seconds. LICA-CS advances the state-of-the-art in lossless image compression, promising enhanced efficiency and effectiveness in image compression technologies.
Adaptive Intrusion Detection System with Ensemble Classifiers for Handling Imbalanced Datasets and Dynamic Network Traffic Almania, Moaad; Zainal, Anazida; Ghaleb, Fuad A; Alnawasrah, Ahmad; Al Qerom, Mahmoud
Journal of Robotics and Control (JRC) Vol. 6 No. 1 (2025)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v6i1.23648

Abstract

Intrusion Detection Systems (IDS) are crucial for network security, but their effectiveness often diminishes in dynamic environments due to outdated models and imbalanced datasets. This paper presents a novel Adaptive Intrusion Detection System (AIDS) that addresses these challenges by incorporating ensemble classifiers and dynamic retraining. The AIDS model integrates K-Nearest Neighbors (KNN), Fuzzy c-means clustering, and weight mapping to improve detection accuracy and adaptability to evolving network traffic. The system dynamically updates its reference model based on the severity of changes in network traffic, enabling more accurate and timely detection of cyber threats. To mitigate the effects of imbalanced datasets, ensemble classifiers, including Decision Tree (DT) and Random Forest (RF), are employed, resulting in significant performance improvements. Experimental results show that the proposed model achieves an overall accuracy of 97.7% and a false alarm rate (FAR) of 2.0%, outperforming traditional IDS models. Additionally, the study explores the impact of various retraining thresholds and demonstrates the model's robustness in handling both common and rare attack types. A comparative analysis with existing IDS models highlights the advantages of the AIDS model, particularly in dynamic and imbalanced network environments. The findings suggest that the AIDS model offers a promising solution for real-time IDS applications, with potential for further enhancements in scalability and computational efficiency.
Two-Level Feature Selection for Enhanced Accuracy and Reduced Computational Overhead in Intrusion Detection Systems Using Rough Set Theory and Binary Particle Swarm Optimization Almania, Moaad; Zainal, Anazida; Ghaleb, Fuad A; Alnawasrah, Ahmad; Al Qerom, Mahmoud
Journal of Robotics and Control (JRC) Vol. 6 No. 1 (2025)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Intrusion Detection Systems (IDS) are essential for safeguarding network infrastructures by detecting and mitigating malicious activities. This study introduces a two-level feature selection approach (TLFSA) designed to enhance classification accuracy and reduce computational overhead. The first phase employs Rough Set Theory (RST) to filter out irrelevant features, while the second phase uses Binary Particle Swarm Optimization (BPSO) to refine the feature subset based on their discriminative power. Experiments conducted on the NSL-KDD dataset show that the TLFSA approach outperforms traditional algorithms such as Genetic Algorithm (GA) and Gravitational Search Algorithm (GSA), achieving a notable improvement of 0.99% in classification accuracy. Furthermore, class-specific feature subsets produced by the method demonstrate superior detection rates across all network traffic classes, with an average accuracy of 97.22%, compared to 91.11% for alternative methods. The proposed method effectively reduces the feature set to approximately 15% of the original features, streamlining the IDS model and improving both operational efficiency and real-time applicability.