Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) for classification purpose. The results obtained from the different groups are then fused using Naïve Bayes classifier to make the final decision regards the emotion class. Different tests were performed using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the achieved results showed that the system gives the desired accuracy (100%) when fusion decisions of the facial groups. The achieved result outperforms state-of-the-art results on the same database.
Increasing demands on producing environmentally friendly products are becoming a driving force for designing highly active catalysts. Thus, surfaces that efficiently catalyse the nitrogen reduction reactions are greatly sought in moderating air-pollutant emissions. This contribution aims to computationally investigate the hydrodenitrogenation (HDN) networks of pyridine over the γ-Mo2N(111) surface using a density functional theory (DFT) approach. Various adsorption configurations have been considered for the molecularly adsorbed pyridine. Findings indicate that pyridine can be adsorbed via side-on and end-on modes in six geometries in which one adsorption site is revealed to have the lowest adsorption energy (
... Show MoreThis paper presents a study of wavelet self-organizing maps (WSOM) for face recognition. The WSOM is a feed forward network that estimates optimized wavelet based for the discrete wavelet transform (DWT) on the basis of the distribution of the input data, where wavelet basis transforms are used as activation function.
A field experiment was carried out during the seasons 2016 and 2017 in the farm of the Department of Field Crops Science, College of Agricultural Engineering Sciences-University of Baghdad to evaluate the effect of(Aminopyralid + Flurasulam, Coldinafop-propargyl and Flucarbazone-sodium) herbicides and seeding rate (100, 125 and 150) Kg.ha-1 and the interaction between them in growth characteristics, grain and yield components in wheat (Var. IPA99). The results showed that herbicides used were significantly efficient in studied characteristics compared to weedy treatment. Herbicide Flucarbazone-sodium gave higher weed control after 60 and 90 days of spraying the he
The aim of the research is to estimate the hidden population. Here، the number of drug users in Baghdad was calculated for the male age group (15-60) years old ، based on the Bayesian models. These models are used to treat some of the bias in the Killworth method Accredited in many countries of the world.
Four models were used: random degree، Barrier effects، Transmission bias، the first model being random، an extension of the Killworth model، adding random effects such as variance and uncertainty Through the size of the personal network، and when expanded by adding the fact that the respondents have different tendencies، the mixture of non-random variables with random to produce
... Show MoreThis paper presents the application of a framework of fast and efficient compressive sampling based on the concept of random sampling of sparse Audio signal. It provides four important features. (i) It is universal with a variety of sparse signals. (ii) The number of measurements required for exact reconstruction is nearly optimal and much less then the sampling frequency and below the Nyquist frequency. (iii) It has very low complexity and fast computation. (iv) It is developed on the provable mathematical model from which we are able to quantify trade-offs among streaming capability, computation/memory requirement and quality of reconstruction of the audio signal. Compressed sensing CS is an attractive compression scheme due to its uni
... Show MoreQuantum dots of CdSe, CdS and ZnS QDs were prepared by chemical reaction and used to fabricate organic quantum dot hybrid junction device. QD-LEDs were fabricated using layers of ITO/TPD: PMMA/CdSe/Alq3, ITO/TPD: PMMA/CdS/Alq3 and ITO/TPD: PMMA/ZnS/Alq3 devices which prepared by phase segregation method. The hybrid white light emitting devices consists, of three-layers deposited successively on the ITO glass substrate; the first layer was of N, N’-bis (3-methylphenyl)-N, N’-bis (phenyl) benzidine (TPD) polymer mixed with polymethyl methacrylate (PMMA) polymers. The second layer was QDs while the third layer was tris (8-hydroxyquinoline) aluminium (Alq3
... Show MoreWe report on using a CO2 (10.6 µm) laser to debond the lithium disilicate veneers. Sixty-four sound human premolar teeth and 64 veneer specimens were used in the study. The zigzag movement via CO2 laser handpiece along with an air-cooled jet to prevent temperature elevation above the necrosis temperature limit (5.5 C°) was applied. The optimal deboning irradiation time was super-fast, at about 5 seconds at 3 Watt CO2 laser power. It is 20 times less than any previously published work for veneers debonding. The enamel beneath the debonded veneers has been assessed by atomic force microscopy (AFM) and shear stress technique as criteria for the easiness of debonding. The
... Show MoreIn a connected graph , the distance function between each pair of two vertices from a set vertex is the shortest distance between them and the vertex degree denoted by is the number of edges which are incident to the vertex The Schultz and modified Schultz polynomials of are have defined as:
respectively, where the summations are taken over all unordered pairs of distinct vertices in and is the distance between and in The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.