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 MoreAn Optimal Algorithm for HTML Page Building Process
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 MoreMost 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 MoreIn 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أستهدفت الدراسة اختبار أثر التوجه السوقي والتزام العاملين على أداء المنظمة المسوقة لخدمات النقل الجوي. حيث تم اختيار شركة الخطوط الجوية الملكية الأردنية كمجال تطبيقي.وقد اعتمدت الدراسة في قياس المتغيرات على مقاييس مختبرة وقد تأكد صحتها وثباتها لقياس المتغيرات في البيئة الحالية. وقد بينت نتائج التحليل الإحصائي الذي استخدمت فيه أساليب إحصائية مختلفة بالاستعانة ببرنامج SPSS))
The 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 MoreCorrelation and path coefficient analysis were worked out for ten morphological traits in 30 three-way crosses of maize. Phenotypic and genotypic correlation analysis indicated that ear length; row numbers per ear, grain numbers per row, leaf area and leaves numbers had a positive significant correlation with grain yield per plant. Further partitioning of correlation coefficients into direct and indirect effects showed that traits days to silking, row numbers per row and leaves numbers had a positive direct effect on grain yield per plant. The traits ear length, grain numbers per row and leaf area had a maximum total effect on grain yield. Furthermore, PCA analysis has gave interested