Preferred Language
Articles
/
bsj-9698
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 Oriented Gradients) is utilized to extract from the images. In addition, the Binarized Genetic Algorithm (BGA) is utilized as a features selection in order to select the most effective features of HOG. Random Forest (RF) functions as a classifier to categories facial emotions in people according to the image samples. The facial human examples of photos that have been extracted from the Yale Face dataset, where it contains the eleven human facial expressions are as follows; normal, left light, no glasses, joyful, centre light, sad, sleepy, wink and surprised. The proposed system performance is evaluated relates to accuracy, sensitivity (i.e., recall), precision, F-measure (i.e., F1-score), and G-mean. The highest accuracy for the proposed BGA-RF method is up to 96.03%. Besides, the proposed BGA-RF has performed more accurately than its counterparts. In light of the experimental findings, the suggested BGA-RF technique has proved its effectiveness in the human facial emotions identification utilizing images.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Jul 01 2023
Journal Name
Iraqi Journal Of Veterinary Sciences
Genetic confirmation for morphological identification of Stilesia globipunctata in camel in Iraq
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Sun Jun 01 2025
Journal Name
Journal Of University Of Anbar For Pure Science
SARS-CoV-2 history, diagnosis, genetic diversity and treatment: a comprehensive review
...Show More Authors

This article comprehensively examines the history, diagnosis, genetics, diversity, and treatment of SARS-CoV-2. It details the emergence of coronaviruses over the past 50 years, including the coronavirus from 2019 and its subsequent mutations, along with updated information about this virus. This review explains the development and nomenclature of coronaviruses, their cellular invasion through glycoprotein spikes binding to ACE-2 receptors, and the mechanism of cell entry via endocytosis. Diagnosis methods for COVID-19, including nucleic acid amplification, serology, and imaging techniques like chest X-ray and CT scan tests, are discussed. Treatment approaches for COVID-19 are outlined, emphasizing healthcare, antiviral medications like Rem

... Show More
Preview PDF
Scopus Crossref
Publication Date
Tue May 16 2023
Journal Name
Journal Of Engineering
System Identification Algorithm for Systems with Interval Coefficients
...Show More Authors

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

View Publication Preview PDF
Crossref
Publication Date
Thu Jun 06 2024
Journal Name
Journal Of Applied Engineering And Technological Science (jaets)
Lightweight Block and Stream Cipher Algorithm: A Review
...Show More Authors

Most of the Internet of Things (IoT), cell phones, and Radio Frequency Identification (RFID) applications need high speed in the execution and processing of data. this is done by reducing, system energy consumption, latency, throughput, and processing time. Thus, it will affect against security of such devices and may be attacked by malicious programs. Lightweight cryptographic algorithms are one of the most ideal methods Securing these IoT applications. Cryptography obfuscates and removes the ability to capture all key information patterns ensures that all data transfers occur Safe, accurate, verified, legal and undeniable.  Fortunately, various lightweight encryption algorithms could be used to increase defense against various at

... Show More
View Publication
Scopus (2)
Scopus Crossref
Publication Date
Fri Apr 20 2012
Journal Name
International Journal Of Computer And Information Engineering
An Optimal Algorithm for HTML Page Building Process
...Show More Authors

An Optimal Algorithm for HTML Page Building Process

View Publication Preview PDF
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (32)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

... Show More
View Publication
Scopus (34)
Crossref (31)
Scopus Clarivate Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Symmetry
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

... Show More
View Publication
Scopus (25)
Crossref (26)
Scopus Clarivate Crossref