Proceedings of the 13th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2020, 27-28 August 2020, Cyberspace

Research Article

Semi-supervised Corrupted Face Classification via Graph Learning

Download341 downloads
  • @INPROCEEDINGS{10.4108/eai.27-8-2020.2296556,
        author={ZHONG  YISHENG and AO  LI},
        title={Semi-supervised Corrupted Face Classification via Graph Learning},
        proceedings={Proceedings of the 13th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2020, 27-28 August 2020, Cyberspace},
        publisher={EAI},
        proceedings_a={MOBIMEDIA},
        year={2020},
        month={11},
        keywords={semi-supervised face classification graph learning self-representation model low-rank constraint},
        doi={10.4108/eai.27-8-2020.2296556}
    }
    
  • ZHONG YISHENG
    AO LI
    Year: 2020
    Semi-supervised Corrupted Face Classification via Graph Learning
    MOBIMEDIA
    EAI
    DOI: 10.4108/eai.27-8-2020.2296556
ZHONG YISHENG1, AO LI1,*
  • 1: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China
*Contact email: dargonboy@126.com

Abstract

Semi-supervised learning aims to training model with both of labeled and unlabeled data by exploring the relationships among them. Graph-based semi-supervised learning is an classical representative method that learning the class indicator matrix by propagating the similarity within the well designed graph constructed by data. However, for face data, they often happen to pixel missing or occlusion, which will degrade the graph learning performance, leading awful semi-supervised classification results. To address this problem, a novel semi-supervised corrupted face classification method via graph learning is proposed, in which the dynamic graph is learned by the completion face data recovered from the low-rank subspace. In our proposed method, the robust data representation and graph learning are implemented alternatively to obtain the overall optimal solutions. Experimental results demonstrate that our proposed method outperforms comparison methods on both of classification accuracy and robustness.