Learning to cluster faces on an affinity graph
Open accessAbstract
Face recognition sees remarkable progress in recent years, and its performance has reached a very high level. Taking it to a next level requires substantially larger data, which would involve prohibitive annotation cost. Hence, exploiting unlabeled data becomes an appealing alternative. Recent works have shown that clustering unlabeled faces is a promising approach, often leading to notable performance gains. Yet, how to effectively cluster, especially on a large-scale (i.e. million-level or above) dataset, remains an open question. A key challenge lies in the complex variations of cluster patterns, which make it difficult for conventional clustering methods to meet the needed accuracy. This work explores a novel approach, namely, learning to cluster instead of relying on hand-crafted criteria. Specifically, we propose a framework based on graph convolutional network, which combines a detection and a segmentation module to pinpoint face clusters. Experiments show that our method yields significantly more accurate face clusters, which, as a result, also lead to further performance gain in face recognition.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Domain generalization techniques have been adopted in face recognition scenarios to enable unsupervised training.
“To overcome the problem of data scarcity, domain generalization techniques have been adopted in face recognition scenarios to enable unsupervised training.”
From Trustworthy AI: From Principles to Practices (2023) · cites this paper as [93]
The Introduction (page not provided) links costly face annotations to interest in exploiting unlabeled data. Section 4.2.2 (page not provided) describes assigning pseudo-labels to unlabeled faces, but the recognition model is trained with labeled data and pseudo-labels. The paper does not identify domain generalization as its technique or describe fully unsupervised training. (LLM, conf=0.88)
Experimental — accuracy not yet measuredSome approaches cluster unlabeled face images to generate pseudo labels for training.
“For example, some approaches cluster unlabeled face images to generate pseudo labels for training [93].”
From Trustworthy AI: From Principles to Practices (2023) · cites this paper as [93]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
FaceNet: A unified embedding for face recognition and clustering
Schroff, F., Kalenichenko, D., & Philbin, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298682 · Cited by 15,267 · see citing works
ArcFace: Additive Angular Margin Loss for Deep Face Recognition
Deng, J., Guo, J., Xue, N., & Zafeiriou, S. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00482 · Cited by 7,781 · see citing works
CosFace: Large Margin Cosine Loss for Deep Face Recognition
Wang, H., Wang, Y., Zhou, Z., Ji, X., Gong, D., Zhou, J., Li, Z., & Liu, W. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00552 · Cited by 3,034 · see citing works
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Flagged first, then by citations
Research works printed but not linked: 28
- 10.1007/11788034_17 · DOI
- zhang, 2018, Accelerated training for massive classification via dynamic class selection, Thirty-Second AAAI Conference on Artificial Intelligence
- 10.1007/978-3-030-01240-3_35 · DOI
- 10.1109/ICCV.2017.322 · DOI · Paper page
- 10.1109/CVPR.2003.1211332 · DOI
- 10.1016/j.patrec.2009.09.011 · DOI
- kaufman, 2009, Finding Groups in Data An Introduction to Cluster Analysis, 344
- 10.1109/CVPR.2016.527 · DOI · Paper page
- kipf, 2017, Semi-supervised classification with graph convolutional networks, ICLRE
- 10.1109/CVPR.2015.7298803 · DOI
- 10.1109/CVPR.2018.00848 · DOI
- 10.1109/FG.2017.134 · DOI
- 10.1109/TIT.1982.1056489 · DOI · Paper page
- 10.1109/CVPR.2011.5995566 · DOI
- ester, 1996, A density-based algorithm for discovering clusters in large spatial databases with noise, KDD
- 10.1109/ICCV.2015.169 · DOI · Paper page
- yan, 2018, Spatial temporal graph convolutional networks for skeleton-based action recognition, AAAI, 10.1609/aaai.v32i1.12328 · DOI · Paper page
- 10.1145/1102351.1102379 · DOI
- guo, 2016, Ms-celeb-1m: A dataset and benchmark for large-scale face recognition, ECCV
- 10.1109/CVPR.2014.81 · DOI · Paper page
- 10.1145/1240624.1240684 · DOI
- hamilton, 2017, Inductive representation learning on large graphs, NeurIPS
- 10.1109/TPAMI.2017.2679100 · DOI
- 10.18637/jss.v053.i09 · DOI
- 10.1109/ICIP.2014.7025068 · DOI
- 10.1093/comjnl/16.1.30 · DOI
- 10.1109/TIFS.2018.2796999 · DOI
- sun, 2014, Deep learning face representation by joint identification-verification, NeurIPS
Cited by
Sorted by citations
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612 · see citing works
She, H., Hu, Y., Liu, B., Li, J., & Li, C.-T. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3451356 · Cited by 24 · see citing works
“The use of graph neural networks has achieved great success in image restoration [17], privacy-leaking image detection [18], face recognition [19], face clustering [20], object detection segmentation and pose estimation [21] and so on.”
BackgroundMethod
- Authors
- Yang, L., Zhan, X., Chen, D., Yan, J., Loy, C. C., & Lin, D.
- Affiliations
- Chinese University of Hong Kong (HK)
- Sensetime (China) (CN)
- Nanyang Technological University (SG)
- Venue
- 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2019-06
- Pages
- 2293-2301
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2930556772
- Cited by
- 142
- References
- 4
- Citations by year
- 2026: 3 · 2025: 10 · 2024: 14 · 2023: 27 · 2022: 36 · 2021: 32 · 2020: 17 · 2019: 3
- FWCI
- 7.17
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Ministry of Education, India
- Chinese University of Hong Kong
- SenseTime Group
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face recognition and analysis
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Life Sciences › Neuroscience › Cognitive Neuroscience › Face Recognition and Perception
- Keywords
- face clustering, affinity graph, graph convolutional networks, face recognition, unlabeled data, big data clustering, face detection, face segmentation, cluster detection
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review