2017
DOI: 10.1007/s41095-016-0068-y
|View full text |Cite
|
Sign up to set email alerts
|

Robust facial landmark detection and tracking across poses and expressions for in-the-wild monocular video

Abstract: We present a novel approach for automatically detecting and tracking facial landmarks across poses and expressions from in-the-wild monocular video data, e.g., YouTube videos and smartphone recordings. Our method does not require any calibration or manual adjustment for new individual input videos or actors. Firstly, we propose a method of robust 2D facial landmark detection across poses, by combining shape-face canonical-correlation analysis with a global supervised descent method. Since 2D regression-based m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 55 publications
(93 reference statements)
0
7
0
Order By: Relevance
“…2D model‐based methods include popular AAM‐based methods: AAM‐1, and AAM‐2 . A recent 3D robust method is also compared. These methods are also trained on the same three databases.…”
Section: Experiments and Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…2D model‐based methods include popular AAM‐based methods: AAM‐1, and AAM‐2 . A recent 3D robust method is also compared. These methods are also trained on the same three databases.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…Usually, given L labeled 2D landmarks and corresponding predefined 3D landmarks on its 3D face mesh, the pose matrix { R , t }, identity coefficients u , expression coefficients e , and displacements D = { d k } can be solved by minimizing the Huber loss function applied to re‐projected error between 2D landmarks and 3D landmarks: argminPk=1Ldkϵ2 where P ={ R , t , u , e , D } and d k is computed on the basis of the definition above: dk=sk()boldRfalse(Cr×2uT×3eTfalse)+boldtfalse(vkfalse) In the case that 2D landmarks has been detected, a nonlinear trust region optimization method like a sparse variant of the Levenberg–Marquardt algorithm can be used to solve pose and bilinear parameters, as Shuang et al do. It is obvious that a reliable landmark detector is necessary, but popular detectors are usually 2D‐based and cannot capture large variations of pose and expression out of plane.…”
Section: Supervised Coordinate Descent Methods With a 3d Bilinear Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…In our experiments the landmark detector in [21] achieved the best trade-off between efficiency and accuracy, but for applications where real-time is not a priority the landmark detector could be swapped by more robust ones such as in [40,41]. To reduce redundancy only representative landmarks are chosen as described in [24] as well. The landmarks in frame i is denoted as S i , and the 3D parametric model from [6] is represented as:…”
Section: Parametric Model Fittingmentioning
confidence: 99%
“…Song et al [17] proposed a half-face dictionary integration algorithm for representation-based classification, the strength of this method is that it is able to successfully construct the dual-column (row) half-face training matrix, while quantifying the integrated learning atoms that exert influence on signal reconstruction. The use of virtual face images [18,19] has also been proven beneficial to a number of face analysis tasks such as face recognition [20,21] and facial landmark detection [22,23,24,25,26]. Facial symmetry property has also been widely used to quickly locate the candidate samples in face detection, alignment and classification [27,28,29].…”
mentioning
confidence: 99%