A method and system for detecting temporal segments of talking faces in a video sequence using visual cues. The system detects talking segments by classifying talking and non-talking segments in a sequence of image frames using visual cues. The present disclosure detects temporal segments of talking faces in video sequences by first localizing face, eyes, and hence, a mouth region. Then, the localized mouth regions across the video frames are encoded in terms of integrated gradient histogram (IGH) of visual features and quantified using evaluated entropy of the IGH. The time series data of entropy values from each frame is further clustered using online temporal segmentation (K-Means clustering) algorithm to distinguish talking mouth patterns from other mouth movements. Such segmented time series data is then used to enhance the emotion recognition system.
|
17. A method for detecting talking and non-talking segments in a sequence of image frames, the method comprising:
detecting, by a processor, a face region in the sequence of image frames by anchoring a location of pupils of a face;
determining whether the face of the face region is talking or not talking;
when the face is not talking, obtaining features of an entire portion of the face;
when the face is talking, obtaining features of an upper portion of the face; and
inferring at least one emotion of the face region using action units that are predicted based on the obtained features.
1. A method for detecting and classifying talking segments of a face in a visual cue in order to infer emotions, the method comprising:
normalizing and localizing a face region for each frame of the visual cue;
obtaining a histogram of structure descriptive features of the face for the frame in the visual cue;
deriving an integrated gradient histogram (IGH) from the descriptive features for the frame in the visual cue;
computing entropy of the IGH for the frame in the visual cue;
performing segmentation of the IGH to detect talking segments for the face in the visual cues; and
analyzing the segments for the frame in the visual cues to infer emotions.
10. A computer program product for detecting and classifying talking segments of a face in a visual cue, the product comprising:
an integrated circuit further comprising at least one processor;
at least one memory having a computer program code within the integrated circuit;
the at least one memory and the computer program product configured to, with the at least one processor, cause the product to:
normalize and localize a face region for each frame of the visual cue;
obtain a histogram of structure descriptive features for the frame in the visual cue;
derive an integrated gradient histogram (IGH) from the descriptive features for the frame in the visual cue;
compute entropy of the IGH for the frame in the visual cue;
perform segmentation of the IGH to detect talking segments for the face in the visual cue; and
analyze the segments for the frame in the visual cue for inferring emotions.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method as in
7. The method as in
8. The method as in
9. A non-transitory computer readable recording medium storing a program for detecting and classifying talking segments of a face in a visual cue, the program comprising instructions for causing a computer to implement the steps of
11. The computer program product of
12. The computer program product of
13. The computer program product of
14. The computer program product of
15. The computer program product of
16. The computer program product of
18. The method of
19. The method of
20. The method of
|
This application claims the priority benefit of Indian Patent Application No. 1519/CHE/2012, filed on Apr. 17, 2012, in the Indian Patent Office, and Korean Patent Application No. 10-2012-0086189, filed on Aug. 7, 2012, in the Korean Intellectual Property Office, the disclosures of each of which are incorporated herein by reference.
1. Field
Example embodiments of the following disclosure relate to image processing, computer vision and machine learning, and more particularly, relate to emotion recognition in a video sequence.
2. Description of the Related Art
With recent developments in technology, significant attention has been given to enhancing human computer interaction (HCl). In particular, engineers and scientists are attempting to capitalize from basic human attributes, such as voice, gaze, gesture and emotional state, in order to improve HCl. The ability of a device to detect and respond to human emotions is known as “Affective Computing.”
Automatic facial expression recognition is a key component in the research field of human computer interaction. Automatic facial expression recognition also plays a major role in human behavior modeling, which has significant potential in applications like video conferencing, gaming, surveillance, and the like. Most of the research in automatic facial recognition, however, is directed to identifying six basic emotions (sadness, fear, anger, happiness, disgust, surprise) on posed facial expression datasets prepared under controlled laboratory conditions. Researchers have adopted static as well as dynamic methods to infer different emotions in the facial expression datasets. Static methods analyze frames in a video sequence independently, while dynamic methods consider a group of consecutive frames to infer a particular emotion.
The mouth region of the human face contains highly discriminative information regarding the human emotion and plays a key role in the recognition of facial expressions. However, in a general scenario, such as, video conferencing, there will be significant temporal segments of the person talking, and any facial expression recognition system that relies upon the mouth region of the face of the person talk for inferring emotions may potentially be misled by the random and complex formations around the lip region. The temporal segment information regarding talking segments in a video sequence is quite important in this context as it can be used enhance the existing emotion recognition systems.
Few major works in the field of emotion recognition have addressed the condition of ‘talking faces’ under which the Action Units (AU) inferred for the mouth region may go potentially wrong, resulting in an erroneous emotion classification. Currently, known methods are directed at determining active speakers in a multi-person environment and do not intend to temporally segment lip activities of a single person into talking and non-talking (which includes neutral as well as various emotion segments) phases. As a result, the current systems suffer from drawbacks of failing to capture exact emotions.
Due to the abovementioned reasons, it is evident that there is a need for methods that intend to temporally segment lip activities into talking and non-talking phases and exact classification of emotions.
An object of the example embodiments of the present disclosure herein is to provide a system and method for detecting talking segments in visual cues.
Another object of the present disclosure is to provide an unsupervised temporal segmentation method for detecting talking faces.
Accordingly, the present disclosure provides a method for detecting and classifying talking segments of a face in a visual cue, the method including normalizing and localizing the face region for each frame of the visual cue and obtains a histogram of structure descriptive features of the face for the frame in the visual cue. Further, the method derives an integrated gradient histogram (IGH) from the descriptive features for the frame in the visual cue, then computing entropy of the integrated gradient histogram (IGH) for the frame in the visual cue and then the method performs segmentation of the IGH to detect talking segments for the face in the visual cues and analyzing the segments for the frame in the visual cues for inferring emotions.
Accordingly, the present disclosure provides a computer program product for detecting and classifying talking segments of a face in a visual cue, the product including an integrated circuit. Further, the integrated circuit includes at least one processor, at least one memory having a computer program code within the circuit, the at least one memory and the computer program code configured to, with the at least one processor, cause the product to normalize and localize the face region for each frame of the visual cue. Then the computer program product obtains a histogram of structure descriptive features for the frame in the visual cue and derive integrated gradient histogram (IGH) from the descriptive features for the frame in the visual cue and compute entropy of the integrated gradient histogram (IGH) for the frame in the visual cue, further the computer program product perform segmentation of the IGH to detect talking segments for the face in the visual cues and analyze the segments for the frame in the visual cues for inferring emotions.
These and other aspects of the embodiments herein will be better appreciated and understood when considered in conjunction with the following description and the accompanying drawings. It should be understood, however, that the following descriptions, while indicating preferred embodiments and numerous specific details thereof, are given by way of illustration and not of limitation. Many changes and modifications may be made within the scope of the embodiments herein without departing from the spirit thereof, and the embodiments herein include all such modifications.
The present disclosure is illustrated in the accompanying drawings, throughout which like reference letters indicate corresponding parts in the various figures. The embodiments herein will be better understood from the following description with reference to the drawings, in which:
The embodiments herein and the various features and advantageous details thereof are explained more fully with reference to the non-limiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well-known components and processing techniques are omitted so as to not unnecessarily obscure the embodiments herein. The examples used herein are intended merely to facilitate an understanding of ways in which the embodiments herein can be practiced and to further enable those of skill in the art to practice the embodiments herein. Accordingly, the examples should not be construed as limiting the scope of the embodiments herein.
The embodiments herein achieve a system and method to detect talking and non-talking segments in a sequence of image frames using visual cues. The method uses visual cues since, in this regard, audio cues may also come from different persons in range other than the target speaker and may mislead the detection. Moreover, the method is directed to classifying talking and non-talking segments, in which the non-talking segments may have different expressions with audio, such as, laughter, exclamation, and the like. Hence, visual cues may be used in distinguishing between the talking and non-talking segments. Depending on embodiments, the method identifies temporal segments of talking faces in video sequences by estimating uncertainties involved in the representation of mouth or lip movements. In an example embodiment, mouth movements are encoded onto an Integrated Gradient Histogram (IGH) of Local Binary Pattern (LBP) values after an initial mouth localization step. The uncertainties in the mouth movements are quantified by evaluating entropy of the IGH. The time series data of entropy values from each frame is further clustered using online K-Means algorithm to distinguish talking mouth patterns from other mouth movements.
The visual cues mentioned throughout the present disclosure may be a photograph, image frame, or video data containing a sequence of frames.
Referring now to the drawings, and more particularly to
In an example embodiment, the talking face refers to a face that talks with or without any emotions. Further, a non-talking face refers to the face that does not talk, but does show some emotions. The various steps in method 100 of
In an example embodiment, the distance between the pupils is maintained as 48 pixels to normalize the faces and crop the mouth region to the size of 56×46 pixels.
The cropped sequence of mouth images may have variations of illumination and alignment across the frames and hence the method selects a feature descriptor that can handle such conditions. In an example embodiment, the method derives at least one histogram of Local Binary Pattern (LBP) values to encode the appearance of the mouth region in step 205. The LBP is a powerful feature used for texture classification which is later proven to be very effective with face recognition and related applications. In an example embodiment, the LBP pattern is computed for every pixel in the cropped out image of the mouth region. In addition, uniform LBP patterns (patterns with at most two bit wise transitions) may be similarly used and classified. The histogram of LBP values evaluated for the cropped image is used to describe the appearance of the mouth region in the respective frame.
Depending on embodiments, the system and method may distinguish the complex change of an appearance in the case of the talking mouth from the smoother appearance change of mouth movements exhibited in the onset and offset of emotions like smile, surprise, disgust, and the like. Further, for neutral faces with no talking involved there will not be much change in the appearance of the mouth. In an example embodiment, to distinguish the complex change, the gradient histograms are computed from a specific frame, say frame i, with the intention to capture the appearance changes over a time period 2τ. The gradient LBP histograms are computed, as follows:
Hin=Hi−Hi+n
Hi−n=Hi−Hi−n
where Hin is the gradient histogram computed using the difference between the histograms of the ith frame and the (i+n)th frame, and Hi−n is the gradient histogram computed using the difference between the histograms of the ith frame and the (i−n)th frame.
The gradient histograms encode the appearance changes in the mouth patterns along the temporal dimension. An example embodiment of the present disclosure takes the complete information regarding the appearance change over a time segment 2τ+1 and encodes the information into a single Integrated Gradient Histogram (IGH) in step 206, as follows:
The series of talking frames will have more evenly distributed IGH values as compared to the frames displaying a particular emotion. In other words, the uncertainty involved in the IGH representation is more for talking segments as compared to the emotion segments. Hence, an example embodiment of the present disclosure performs online temporal segmentation of IGH entropy and uses the entropy of the IGH to quantify the amount of uncertainty in the video segment under consideration. The entropy of IGH of ith frame is calculated as follows:
where Epi is the entropy value of IGH of ith frame and pk is the histogram value for kth bin.
Further, the integrated gradient histogram is normalized before evaluating the entropy of the IGH. This arises from the need to compare the entropy values across different temporal segments. The energy values of the IGH over different temporal segments may vary as a result of the gradient process. The energy values are normalized by adding the common energy between the original LBP histograms as a separate bin in the IGH. For static segments, this common energy is a large spike in the IGH and may result in less entropy. For emotion segments, the common energy may be comparable to a slow talking process. However, the gradient energy part of IGH has a larger spread in talking segments and hence may have higher entropy compared to emotion segments. The temporal series data of entropy values evaluated from the IGH of every frame is used for unsupervised online segmentation of talking and non-talking faces.
In an example embodiment, the entropy values are obtained for every frame in the video sequence to form time series data. The time series data is then segmented in an unsupervised online fashion so as to provide the required input to the emotion recognition system regarding the presence of talking faces in the video sequence. In an example embodiment, the system may use online K-Means algorithm to segment the time series data where K=2. No further assumptions are made regarding the range or initial values of data.
The problem of inferring emotions in the presence of occlusions over the mouth region has been addressed to improve the accuracy of emotion detection. In
In another example embodiment, an improved emotion recognition is provided by using the mouth region but changing the strategy of recognition, once talking is detected. Even though image features from a talking face cannot be easily interpreted, the mouth region still holds some cues to the current emotion. For example, a happy talking face and a sad talking face may be discerned. It is to be noted that, the approach to infer emotions from talking faces using the mouth region would be different from a usual emotion recognition system. One skilled in the art will realize that movement of the lip corners may help distinguish certain emotions even while talking. The various steps in method 200 of
In an example embodiment, the method may be used in video conferring, meeting or interview scenario, in which the camera is focused to the person. In addition, the method may detect the talking and non-talking faces of the person involved in the session and determine the emotions of that person. Further, the method may also be employed in emotion recognition systems for better categorizing of the emotions.
The overall computing environment can be composed of multiple homogeneous and/or heterogeneous cores, multiple CPUs of different kinds, special media and other accelerators. The processing unit is responsible for processing the instructions of the algorithm. The processing unit receives commands from the control unit in order to perform its processing. Further, any logical and arithmetic operations involved in the execution of the instructions are computed with the help of the ALU. Further, the plurality of process units may be located on a single chip or over multiple chips.
The algorithm including instructions and codes required for the implementation are stored in either the memory unit or the storage or both. At the time of execution, the instructions may be fetched from the corresponding memory and/or storage, and executed by the processing unit.
In case of any hardware implementations various networking devices or external I/O devices may be connected to the computing environment to support the implementation through the networking unit and the I/O device unit.
The embodiments disclosed herein can be implemented through at least one software program running on at least one hardware device and performing network management functions to control the elements. The elements shown in
The embodiments can be implemented in computing hardware (computing apparatus) and/or software, such as (in a non-limiting example) any computer that can store, retrieve, process and/or output data and/or communicate with other computers. The results produced can be displayed on a display of the computing hardware. A program/software implementing the embodiments may be recorded on non-transitory computer-readable media comprising computer-readable recording media. Examples of the computer-readable recording media include a magnetic recording apparatus, an optical disk, a magneto-optical disk, and/or a semiconductor memory (for example, RAM, ROM, etc.). Examples of the magnetic recording apparatus include a hard disk device (HDD), a flexible disk (FD), and a magnetic tape (MT). Examples of the optical disk include a DVD (Digital Versatile Disc), a DVD-RAM, a CD-ROM (Compact Disc—Read Only Memory), and a CD-R (Recordable)/RW.
Further, according to an aspect of the embodiments, any combinations of the described features, functions and/or operations can be provided.
Moreover, the apparatus or computing environment implementing the present disclosure, as shown in
The foregoing description of the specific embodiments will so fully reveal the general nature of the example embodiments herein that others may, by applying current knowledge, readily modify and/or adapt for various applications such specific embodiments without departing from the generic concept, and, therefore, such adaptations and modifications should and are intended to be comprehended within the meaning and range of equivalents of the disclosed embodiments. It is to be understood that the phraseology or terminology employed herein is for the purpose of description and not of limitation. Therefore, while the example embodiments herein have been described in terms of preferred embodiments, those skilled in the art will recognize that the embodiments herein can be practiced with modification within the spirit and scope of the embodiments as described herein.
Velusamy, Sudha, Sharma, Anshul, Gopalakrishnan, Viswanath, Navathe, Bilva Bhalachandra
Patent | Priority | Assignee | Title |
10360441, | Nov 25 2015 | TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED | Image processing method and apparatus |
11238286, | Oct 28 2016 | Microsoft Technology Licensing, LLC | Automatically detecting contents expressing emotions from a video and enriching an image index |
11328159, | Oct 28 2016 | Microsoft Technology Licensing, LLC | Automatically detecting contents expressing emotions from a video and enriching an image index |
Patent | Priority | Assignee | Title |
7130453, | Dec 20 2001 | Matsushita Electric Industrial Co., Ltd. | Eye position detection method and device |
20080212850, | |||
20090304088, | |||
20100296706, | |||
20110058713, | |||
20120274755, | |||
JP10228295, | |||
JP200143345, | |||
JP2005293539, | |||
JP200765969, | |||
JP2008146268, | |||
JP2008146318, | |||
JP201181445, | |||
KR1020080111325, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Jan 30 2013 | VELUSAMY, SUDHA | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 032514 | /0094 | |
Jan 30 2013 | GOPALAKRISHNAN, VISWANATH | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 032514 | /0094 | |
Jan 30 2013 | NAVATHE, BILVA BHALACHANDRA | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 032514 | /0094 | |
Jan 30 2013 | SHARMA, ANSHUL | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 032514 | /0094 | |
Mar 13 2013 | Samsung Electronics Co., Ltd. | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Dec 04 2015 | ASPN: Payor Number Assigned. |
Jan 22 2019 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Jan 16 2023 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Date | Maintenance Schedule |
Aug 18 2018 | 4 years fee payment window open |
Feb 18 2019 | 6 months grace period start (w surcharge) |
Aug 18 2019 | patent expiry (for year 4) |
Aug 18 2021 | 2 years to revive unintentionally abandoned end. (for year 4) |
Aug 18 2022 | 8 years fee payment window open |
Feb 18 2023 | 6 months grace period start (w surcharge) |
Aug 18 2023 | patent expiry (for year 8) |
Aug 18 2025 | 2 years to revive unintentionally abandoned end. (for year 8) |
Aug 18 2026 | 12 years fee payment window open |
Feb 18 2027 | 6 months grace period start (w surcharge) |
Aug 18 2027 | patent expiry (for year 12) |
Aug 18 2029 | 2 years to revive unintentionally abandoned end. (for year 12) |