Abstract

Deep facial recognition benefits significantly from large-scale training data; however, the bottleneck of high labeling costs persists. Therefore, to reduce the labeling costs, it is desirable to train a model using limited labeled data and abundant unlabeled data ( i.e. , semi-supervised learning). However, existing semi-supervised learning methods present two primary challenges: (1) The possibility of identity overlaps between the unlabeled and labeled data. These overlaps can affect the correctness of pseudo-labels of the unlabeled set. (2) Different pseudo-labels generated by the clustering algorithm may belong to the same individual ( i.e. , over-decomposition problem). Thus, in this study, instead of experimenting with non-overlapping conditions, we apply smooth labels to exploit the potential of those samples that are similar to the identities in the labeled set. For samples that are not similar to the labeled set, we introduce a dual clustering strategy to remedy the over-decomposition problem caused by single clustering. With the upgraded semi-supervised framework, we recycle the discarded samples during purification of MS-Celeb-1 M (MS1M) to further scale up the training set, which offers a considerable performance boost of 94.39% on the IJB-C dataset. • Pioneering use of raw unlabeled data. • Utilizing of overlaps by relaxing the intra-class constraint with label smoothing. • Dual clustering strategy to address the over decomposition problem caused by a single clustering.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.