Image-based face beauty analysis via graph-based semi-supervised learning

被引:7
作者
Dornaika, F. [1 ,2 ]
Elorza, A. [1 ]
Wang, K. [1 ,3 ]
Arganda-Carreras, I. [1 ,2 ,4 ]
机构
[1] Univ Basque Country UPV EHU, San Sebastian, Spain
[2] Basque Fdn Sci, Ikerbasque, Bilbao, Spain
[3] Northwestern Polytech Univ, Xian, Shaanxi, Peoples R China
[4] DIPC, San Sebastian, Spain
关键词
Image-based face beauty analysis; Semi-supervised learning; Graph-based label propagation; Deep face features; FACIAL ATTRACTIVENESS;
D O I
10.1007/s11042-019-08206-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Automatic facial beauty analysis has become an emerging research topic. Despite some achieved advances, current methods and systems suffer from at least two limitations. Firstly, many developed systems rely on the use of ad-hoc hand-crafted features that were designed for generic pattern recognition problems. Secondly, while Deep Convolutional Neural Nets (DCNN) have been recently demonstrated to be a promising area of research in statistical machine learning, their use for automatic face beauty analysis may not guarantee optimal performances due to the use of a limited amount of face images with beauty scores. In this paper, we attempt to overcome these two main limitations by jointly exploiting two tricks. First, instead of using hand-crafted face features we use deep features of a pre-trained DCNN able to generate a high-level representation of a face image. Second, we exploit manifold learning theory and deploy three graph-based semi-supervised learning methods in order to enrich model learning without the need of additional labeled face images. These schemes perform graph-based score propagation. The proposed schemes were tested on three public datasets for beauty analysis: SCUT-FBP, (MB)-B-2, and SCUT-FBP5500. These experiments, as well as many comparisons with supervised schemes, show that the scheme coined Kernel Flexible Manifold Embedding compares favorably with many supervised schemes. They also show that its performances in terms of error prediction and Pearson Correlation are better than those reported for the used datasets.
引用
收藏
页码:3005 / 3030
页数:26
相关论文
共 42 条
[1]  
Aarabi P, 2001, C P IEEE INT C SYST, V4, P2644
[2]  
[Anonymous], 2016, 2016 IEEE GLOB COMM
[3]  
[Anonymous], ARXIV180106345V1CSCV
[4]   The Intrinsic Memorability of Face Photographs [J].
Bainbridge, Wilma A. ;
Isola, Phillip ;
Oliva, Aude .
JOURNAL OF EXPERIMENTAL PSYCHOLOGY-GENERAL, 2013, 142 (04) :1323-1334
[5]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[6]  
Bi J, 2003, Proceedings of the 20th International Conference on Machine Learning (ICML-03)
[7]  
Bottino A, 2010, LECT NOTES COMPUT SC, V6111, P425, DOI 10.1007/978-3-642-13772-3_43
[8]   Learning With l1-Graph for Image Analysis [J].
Cheng, Bin ;
Yang, Jianchao ;
Yan, Shuicheng ;
Fu, Yun ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (04) :858-866
[9]  
DEBACCO C, 2018, ARXIV170909002
[10]   Adaptive graph construction using data self-representativeness for pattern classification [J].
Dornaika, F. ;
Bosaghzadeh, A. .
INFORMATION SCIENCES, 2015, 325 :118-139