Browse State-of-the-Art › Face Clustering
Face Clustering
22 papers with code · 1 benchmark · 3 datasets archive 2025-07-28
Face Clustering in the videos
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| EasyCom (1 row) | VC TRSF. | Self-supervised Video-centralised Transformer for Video Face Clustering | — | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
22 shown of 22 papers with code (62 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
27 Mar 2019 4 repositories listed Syntology ran 1 of 6 samples · 5 unverifiedThe key idea is that we find the local context in the feature space around an instance (face) contains rich information about the linkage relationship between this instance and its neighbors.
-
5 Mar 2012 4 repositories listedIn this paper, we propose and study an algorithm, called Sparse Subspace Clustering (SSC), to cluster data points that lie in a union of low-dimensional subspaces.
-
3 Jul 2021 3 repositories listedOur hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
-
1 Apr 2020 3 repositories listed Syntology ran 2 of 15 samples · 13 unverified · 3 pointer-only (licence)With the vertex confidence and edge connectivity, we can naturally organize more relevant vertices on the affinity graph and group them into clusters.
-
8 Feb 2022 2 repositories listed Syntology ran 0 of 15 samples · 15 unverifiedIn Ada-NETS, each face is transformed to a new structure space, obtaining robust features by considering face features of the neighbour images.
-
6 Sep 2018 2 repositories listedWe address the problem of face clustering in long, real world videos.
-
5 Jul 2015 2 repositories listedSubspace clustering methods based on ℓ₁, ℓ₂ or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success.
-
24 Aug 2024 1 repository listedAn efficient and effective neighbor-based edge probability and a novel early stopping strategy are proposed in FC-ES, guaranteeing the accuracy and recall of large-scale face clustering simultaneously.
-
1 Jan 2023 1 repository listedFor this purpose, we propose a reliable density estimation algorithm based on local connectivity between K nearest neighbors (KNN).
-
8 Oct 2022 1 repository listed Syntology ran 1 of 1 samples · 0 unverifiedA natural way to construct a graph among images is to treat each image as a node and assign pairwise image similarities as weights to corresponding edges.
-
25 Jul 2022 1 repository listed Syntology ran 1 of 1 samples · 0 unverifiedFace clustering is a promising way to scale up face recognition systems using large-scale unlabeled face images.
-
21 Mar 2022 1 repository listedFace clustering is an essential task in computer vision due to the explosion of related applications such as augmented reality or photo album management.
-
6 Jul 2021 1 repository listedAlthough imbalance problem has been extensively studied, the impact of imbalanced data on GCN- based linkage prediction task is quite different, which would cause problems in two aspects: imbalanced linkage labels and…
-
19 Jun 2021 1 repository listedTo address the dilemma of large-scale training and efficient inference, we propose the STructure-AwaRe Face Clustering (STAR-FC) method.
-
24 Mar 2021 1 repository listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)To address the dilemma of large-scale training and efficient inference, we propose the STructure-AwaRe Face Clustering (STAR-FC) method.
-
29 Jul 2020 1 repository listedAn effective approach to automated movie content analysis involves building a network (graph) of its characters.
-
9 Aug 2019 1 repository listedUnderstanding videos such as TV series and movies requires analyzing who the characters are and what they are doing.
-
22 Mar 2019 1 repository listedOne reason is that the measure of cluster separation does not consider the impact of outliers and neighborhood clusters.
-
3 Mar 2019 1 repository listedIn this paper, we address video face clustering using unsupervised methods.
-
30 Oct 2015 1 repository listedFor this nonconvex minimization problem, we develop an effective optimization procedure based on a type of augmented Lagrange multipliers (ALM) method.
-
9 Sep 2015 1 repository listedThe Shape Interaction Matrix (SIM) is one of the earliest approaches to performing subspace clustering (i.
-
18 Aug 2015 1 repository listedHowever, for many real-world applications, nuclear norm approximation to the rank function can only produce a result far from the optimum.
Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections