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.
The analysis of the classic principal components are sensitive to the outliers where they are calculated from the characteristic values and characteristic vectors of correlation matrix or variance Non-Robust, which yields an incorrect results in the case of these data contains the outliers values. In order to treat this problem, we resort to use the robust methods where there are many robust methods Will be touched to some of them.
The robust measurement estimators include the measurement of direct robust estimators for characteristic values by using characteristic vectors without relying on robust estimators for the variance and covariance matrices. Also the analysis of the princ
... Show MoreObjectives: The study aims to investigate the efficiency of physiotherapy methods to improve the
degree of the clinical recovery of the peripheral facial palsy.
Methodology: This study is carried out at the Rehabilitation Center-Baghdad from November 2009 till
March 2010. This study includes (40) patient, their ages are from (13) to (55) years old; (24) male and
(16) female with unilateral facial palsy of undetermined cause. House-Brackmann facial recovery
scores have been used before and after the physiotherapy treatment.
Results: The results show that the physiotherapy sessions obtained the best effect of the electrical
stimulation, exercises and massage in the treatment of facial palsy. Highly respondents in femal
The Al Mishraq site has been the subject of many scientific studies for the period before and
after the fire in 2003. Five visits to the site were conducted twice in 2003 for general fact-finding, twice
in 2004, and once in 2005 for detailed sampling and monitoring. Desk-based research and laboratory analysis of soil and water samples results indicate that surface water and groundwater pollution from Al Mishraq site was significant at the time of its operation. The primary pollution source was the superheated water injection process, while the principal receptor is the River Tigris. Now that the plant is idle, this source is absent. Following the June 2003 sulphur fire, initial investigations indicate that short damage to
vegeta
Activities associated with mining of uranium have generated significant quantities of waste materials containing uranium and other toxic metals. A qualitative and quantitative study was performed to assess the situation of nuclear pollution resulting from waste of drilling and exploration left on the surface layer of soil surrounding the abandoned uranium mine hole located in the southern of Najaf province in Iraq state. To measure the specific activity, twenty five surface soil samples were collected, prepared and analyzed by using gamma- ray spectrometer based on high counting efficiency NaI(Tl) scintillation detector. The results showed that the specific activities in Bq/kg are 37.31 to 1112.47 with mean of 268.16, 0.28 to 18.57 with
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More