Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

Background: Difficulties arise when attempting to imagine the interpupillary line and comparing it with the Fox plane guide and not more difficult than holding any instrument over the movable pupils just to demonstrate the interpupillary line. The aim of this study was to introduce ear lobes as alternative landmarks for the interpupillary line during orientation of the occlusal plane. Also, the other aim was to compare the ear lobes with the pupils of the eyes to verify that they were indifferent as anatomical landmarks. Materials & methods: The alternative landmarks, ear lobes, were presented and the method for orienting the occlusal plane with these landmarks was introduced. Digital pictures of 30 subjects, who participated in the study,

The process of accurate localization of the basic components of human faces (i.e., eyebrows, eyes, nose, mouth, etc.) from images is an important step in face processing techniques like face tracking, facial expression recognition or face recognition. However, it is a challenging task due to the variations in scale, orientation, pose, facial expressions, partial occlusions and lighting conditions. In the current paper, a scheme includes the method of three-hierarchal stages for facial components extraction is presented; it works regardless of illumination variance. Adaptive linear contrast enhancement methods like gamma correction and contrast stretching are used to simulate the variance in light condition among images. As testing material

Its well known that understanding human facial expressions is a key component in understanding emotions and finds broad applications in the field of human-computer interaction (HCI), has been a long-standing issue. In this paper, we shed light on the utilisation of a deep convolutional neural network (DCNN) for facial emotion recognition from videos using the TensorFlow machine-learning library from Google. This work was applied to ten emotions from the Amsterdam Dynamic Facial Expression Set-Bath Intensity Variations (ADFES-BIV) dataset and tested using two datasets.

Background: Bell's palsy was defined as facial weakness of lower motor neuron type caused by idiopathic facial nerve involvement outside the central nervous system without evidence of aural or more widespread neurologic disease. The cause is unclear, but the disorder occurs more commonly in diabetics.Objectives: to differentiate cases of idiopathic Bell's palsy from diabetic mononeuropathy presented with Facial nerve palsy by assessing the taste, because they differ in etiology, management & prognosis.Patients &Methods: One hundred and fifteen consecutive patients were referred for the treatment of facial palsy, from May the 5th 2012 to April 12th 2013 in Al-Kindy Teaching Hospital and The Neurosciences Hospital, in Baghdad / Ira

PKE Sharquie MD, PDPAA Noaimi MD, DDV, FDSM Al-Ogaily MD, IOSR Journal of Dental and Medical Sciences (IOSR-JDMS), 2015

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.