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.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
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. Th
... Show MorePathology 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 MoreTraditionally, 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).
Abstract: Objectives: To investigate the effect of temperature elevation on the bonding strength of resin cement to the zirconia ceramic using fractional CO2 laser. Background: Fractional CO2 laser is an effective surface treatment of zirconia ceramic, as it increases the bonding strength of zirconia to resin cement. Methods: Thirty sintered zirconia discs (10 mm diameter, 2 mm thickness) were prepared and divided to three groups (N=10) and five diffident pulse durations were used in each group (0.1, 0.5, 1, 5 and 10 ms). Group A was treated with 10 W power setting, group B with 20 W and group C with 30 W. During laser irradiation, temperature elevation measurement was recorded for each specimen. Luting cement was bonded to the treated z
... Show More