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.
Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh
... Show MoreThe aim of the study was to know the factors analysis of scale Bar-On & Parker, post analysis is found fourteen factors for the first degree of the scale. Also we extracted five factors from the second degree.
The scale consists of (60) items , applied on sample of (200) students (Male &Female ) age (15-18) years randomly chosen from preparatory schools . The scale unveiled satis factors validity and reliability. An others aims is to low the emotional Intelligence level and know the difference of statistical in sex , age variable and the specialization variable .The result was no difference of statistical in sex and specialization variable , but the difference appear
... Show MoreCommunicative-based textbooks are developed and disseminated throughout the country.
However, it is difficult for teachers who themselves have learnt English through the traditional
approaches to suddenly be familiar with CLT (Communicative Language Teaching) principles
and teach communicatively. Therefore, many teachers remain somewhat confused about what
exactly CLT is and others familiar with CLT but unable to achieve communicative classroom
teaching. Consequently, those teachers need to be introduced to the CLT principles and they need
training in how to put CLT principles into practice. Accordingly, this study aims to find out the
effect of combining video lectures and Kolb experiential learning on EFL student-t
Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly. We make an effort to prove
... Show MoreTo achieve safe security to transfer data from the sender to receiver, cryptography is one way that is used for such purposes. However, to increase the level of data security, DNA as a new term was introduced to cryptography. The DNA can be easily used to store and transfer the data, and it becomes an effective procedure for such aims and used to implement the computation. A new cryptography system is proposed, consisting of two phases: the encryption phase and the decryption phase. The encryption phase includes six steps, starting by converting plaintext to their equivalent ASCII values and converting them to binary values. After that, the binary values are converted to DNA characters and then converted to their equivalent complementary DN
... Show More<p>In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on
... Show MoreOrthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show More