Toward graph-based semi-supervised face beauty prediction

被引:14
作者
Dornaika, Fadi [1 ,2 ]
Wang, Kunwei [1 ,3 ]
Arganda-Carreras, Ignacio [1 ,2 ]
Elorza, Anne [1 ]
Moujahid, Abdelmalik [1 ]
机构
[1] Univ Basque Country, UPV EHU, Leioa, Spain
[2] Ikerbasque, Basque Fdn Sci, Bilbao, Spain
[3] Northwestern Polytech Univ, Xian, Shaanxi, Peoples R China
关键词
Image-based face beauty analysis; Graph-based semi-supervised learning; Graph-based label propagation; Deep face features; FACIAL BEAUTY; ATTRACTIVENESS; COMPUTATION;
D O I
10.1016/j.eswa.2019.112990
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Assessing beauty using facial images analysis is an emerging computer vision problem. To the best of our knowledge, all existing methods for automatic facial beauty scoring rely on fully supervised schemes. In this paper, we introduce the use of semi-supervised learning schemes for solving the problem of face beauty scoring when the image descriptor is holistic and the score is given by a real number. The paper has two main contributions. Firstly, we introduce the use of graph-based semi-supervised learning for face beauty scoring. The proposed method is based on texture and utilizes continuous scores in a full range. Secondly, we adapt and kernelize an existing linear Flexible Manifold Embedding scheme (that works with discrete classes) to the case of real scores propagation. The resulting model can be used for transductive and inductive settings. The proposed semi-supervised schemes were evaluated on three recent public datasets for face beauty analysis: SCUT-FBP, M2B, and SCUT-FBP5500. The obtained experimental results, as well as many comparisons with fully supervised methods, demonstrate that the nonlinear semi-supervised scheme compares favorably with many supervised schemes. The proposed semi supervised scoring framework paves the way to virtually all applications to adopt continuous scores instead of the usual discrete labels. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:12
相关论文
共 56 条
[1]  
Aarabi P, 2001, C P IEEE INT C SYST, V4, P2644
[2]  
[Anonymous], ARXIVABS180602679
[3]  
[Anonymous], ARXIV151102465V1
[4]  
[Anonymous], ARXIV180106345V1CSCV
[5]  
[Anonymous], 2016, PROC 5 INT C AGRO GE
[6]  
[Anonymous], 2018, IEEE T PATTERN ANAL
[7]  
[Anonymous], ARXIV14090575
[8]  
[Anonymous], 2008, 2008 8 IEEE INT C
[9]  
[Anonymous], 2003, INT C MACH LEARN ICM
[10]  
[Anonymous], LNCS