Preferred Language
Articles
/
KPrYtZkBMF18lwyZ-M1A
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. The dual encryption process achieves high diffusion and confusion properties for the cipher process. The second approach proposed a chaotic Arnold map before the Tiny Encryption Algorithm (TEA) process. Various statistical measures are used, such as Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Image Quality Index (IQI). For example, the lower PSNR, SSIM, and IQI values indicate better results for test image Lina of the second approach. The obtained results for the previous measures of the second approach are 8.5449, 0.0008, and -0.0061, compared to the first approach, 8.5529, 0.0054, -0.0015, respectively. Moreover, key space and time analysis are used to assess the encryption process. The outcomes show a high-key space 32,768*2128 ) and a slight encryption time of 130 milliseconds for the first approach and 1862 milliseconds for the second approach. 

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Mon May 01 2017
Journal Name
2017 5th International Conference On Information And Communication Technology (icoic7)
Analysis of the number of ants in ant colony system algorithm
...Show More Authors

View Publication
Scopus (29)
Crossref (14)
Scopus Crossref
Publication Date
Sat May 24 2025
Journal Name
Iraqi Journal For Computer Science And Mathematics
Intrusion Detection System for IoT Based on Modified Random Forest Algorithm
...Show More Authors

An intrusion detection system (IDS) is key to having a comprehensive cybersecurity solution against any attack, and artificial intelligence techniques have been combined with all the features of the IoT to improve security. In response to this, in this research, an IDS technique driven by a modified random forest algorithm has been formulated to improve the system for IoT. To this end, the target is made as one-hot encoding, bootstrapping with less redundancy, adding a hybrid features selection method into the random forest algorithm, and modifying the ranking stage in the random forest algorithm. Furthermore, three datasets have been used in this research, IoTID20, UNSW-NB15, and IoT-23. The results are compared with the three datasets men

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (4)
Scopus Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (6)
Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Facial Emotion Images Recognition Based On Binarized Genetic Algorithm-Random Forest
...Show More Authors

Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or

... Show More
View Publication Preview PDF
Scopus (16)
Crossref (14)
Scopus Crossref
Publication Date
Thu Feb 15 2024
Journal Name
Evolving Systems
Boosted Aquila Arithmetic Optimization Algorithm for multi-level thresholding image segmentation
...Show More Authors

View Publication
Scopus (13)
Crossref (9)
Scopus Clarivate Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (66)
Crossref (50)
Scopus Clarivate Crossref