2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2015
DOI: 10.1109/cvpr.2015.7298833
|View full text |Cite
|
Sign up to set email alerts
|

Joint patch and multi-label learning for facial action unit detection

Abstract: The face is one of the most powerful channel of nonverbal communication. The most commonly used taxonomy to describe facial behaviour is the Facial Action Coding System (FACS). FACS segments the visible effects of facial muscle activation into 30+ action units (AUs). AUs, which may occur alone and in thousands of combinations, can describe nearly all-possible facial expressions. Most existing methods for automatic AU detection treat the problem using one-vs-all classifiers and fail to exploit dependencies amon… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
105
0
1

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 168 publications
(107 citation statements)
references
References 28 publications
1
105
0
1
Order By: Relevance
“…Yet, the complexity of the model in [17] increases quadratically with the number of AUs in the output, while it increases only linearly in case of MC-LVM. Consequently, MC-LVM can efficiently model relations among a relatively large number of outputs, without the requirement to a priori define groups of AUs as done in [17], [14].…”
Section: A Multiple Facial Au Detectionmentioning
confidence: 99%
See 4 more Smart Citations
“…Yet, the complexity of the model in [17] increases quadratically with the number of AUs in the output, while it increases only linearly in case of MC-LVM. Consequently, MC-LVM can efficiently model relations among a relatively large number of outputs, without the requirement to a priori define groups of AUs as done in [17], [14].…”
Section: A Multiple Facial Au Detectionmentioning
confidence: 99%
“…Hence, S ij contains the number of co-activated outputs in all sub-labels between two instances. Note that contrary to [14], we measure the similarity of the outputs based on all possible groups of co-occurring AUs, and not only on pairs of AUs. The graph Laplacian matrix is then defined as L = D − S, where D is a diagonal matrix with D ii = j S ij .…”
Section: Output Constraintsmentioning
confidence: 99%
See 3 more Smart Citations