TY - GEN
T1 - Unsupervised domain adaptation with regularized optimal transport for multimodal 2D+3D facial expression recognition
AU - Wei, Xiaofan
AU - Li, Huibin
AU - Sun, Jian
AU - Chen, Liming
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/6/5
Y1 - 2018/6/5
N2 - Since human expressions have strong flexibility and personality, subject-independent facial expression recognition is a typical data bias problem. To address this problem, we propose a novel approach, namely unsupervised domain adaptation with regularized optimal transport for multimodal 2D+3D Facial Expression Recognition (FER). In particular, Wasserstein distance is employed to measure the distribution inconsistency between the training samples (i.e. source domain) and test samples (i.e. target domain). Minimization of this Wasserstein distance is equivalent to finding an optimal transport mapping from training to test samples. Once we find this mapping, original training samples can be transformed into a new space in which the distributions of the mapped training samples and the test samples can be well-aligned. In this case, classifier learned from the transformed training samples can be well generalized to the test samples for expression prediction. In practice, approximate optimal transport can be effectively solved by adding entropy regularization. To fully explore the class label information of training samples, group sparsity regularizer is also used to enforce that the training samples from the same expression class can be mapped to the same group. Experimental results evaluated on the BU-3DFE and Bosphorus databases demonstrate that the proposed approach can achieve superior performance compared with the state-of-the-art methods.
AB - Since human expressions have strong flexibility and personality, subject-independent facial expression recognition is a typical data bias problem. To address this problem, we propose a novel approach, namely unsupervised domain adaptation with regularized optimal transport for multimodal 2D+3D Facial Expression Recognition (FER). In particular, Wasserstein distance is employed to measure the distribution inconsistency between the training samples (i.e. source domain) and test samples (i.e. target domain). Minimization of this Wasserstein distance is equivalent to finding an optimal transport mapping from training to test samples. Once we find this mapping, original training samples can be transformed into a new space in which the distributions of the mapped training samples and the test samples can be well-aligned. In this case, classifier learned from the transformed training samples can be well generalized to the test samples for expression prediction. In practice, approximate optimal transport can be effectively solved by adding entropy regularization. To fully explore the class label information of training samples, group sparsity regularizer is also used to enforce that the training samples from the same expression class can be mapped to the same group. Experimental results evaluated on the BU-3DFE and Bosphorus databases demonstrate that the proposed approach can achieve superior performance compared with the state-of-the-art methods.
KW - Domain adaptation
KW - Facial expression recognition
KW - Optimal transport
UR - https://www.scopus.com/pages/publications/85049393085
U2 - 10.1109/FG.2018.00015
DO - 10.1109/FG.2018.00015
M3 - 会议稿件
AN - SCOPUS:85049393085
T3 - Proceedings - 13th IEEE International Conference on Automatic Face and Gesture Recognition, FG 2018
SP - 31
EP - 37
BT - Proceedings - 13th IEEE International Conference on Automatic Face and Gesture Recognition, FG 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th IEEE International Conference on Automatic Face and Gesture Recognition, FG 2018
Y2 - 15 May 2018 through 19 May 2018
ER -