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. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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
Papers archive 2025-07-28
archive papers tagged: 62 · with a code link: 22 · where Syntology ran a sample: 6 (5 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (6 of 62 tagged: 5 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 62 of 62, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
27 Mar 2019 4 repositories listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified (of 6 harvested samples) · 1 pointer-only (licence)The 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 official (archive's flag): 9 ran · 11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified (of 15 harvested samples) · 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 official (archive's flag): 11 ran · 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified (of 15 harvested samples)In 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 official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)A 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 official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample)Face 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 official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 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. e., separating points drawn from a union of subspaces).
-
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.
-
VideoClusterNet: Self-Supervised and Adaptive Face Clustering For Videos16 Jul 2024 0 repositories listedWith the rise of digital media content production, the need for analyzing movies and TV series episodes to locate the main cast of characters precisely is gaining importance.Specifically, Video Face Clustering aims to…
-
Improved Face Representation via Joint Label Classification and Supervised Contrastive Clustering7 Dec 2023 0 repositories listedFace clustering tasks can learn hierarchical semantic information from large-scale data, which has the potential to help facilitate face recognition.
-
Learn to Cluster Faces with Better Subgraphs21 Apr 2023 0 repositories listedFace clustering can provide pseudo-labels to the massive unlabeled face data and improve the performance of different face recognition models.
-
CLIP-Cluster: CLIP-Guided Attribute Hallucination for Face Clustering1 Jan 2023 0 repositories listedOne of the most important yet rarely studied challenges for supervised face clustering is the large intra-class variance caused by different face attributes such as age, pose, and expression.
-
Face Clustering via Graph Convolutional Networks with Confidence Edges1 Jan 2023 0 repositories listedFace clustering is a method for unlabeled image annotation and has attracted increasing attention.
-
On the Robustness of Deep Clustering Models: Adversarial Attacks and Defenses4 Oct 2022 0 repositories listedClustering models constitute a class of unsupervised machine learning methods which are used in a number of application pipelines, and play a vital role in modern data science.
-
Learn to Cluster Faces via Pairwise Classification26 May 2022 0 repositories listedFace clustering plays an essential role in exploiting massive unlabeled face data.
-
Character-focused Video Thumbnail Retrieval13 Apr 2022 0 repositories listedWe explore retrieving character-focused video frames as candidates for being video thumbnails.
-
Analysis of Sparse Subspace Clustering: Experiments and Random Projection1 Apr 2022 0 repositories listed
-
Using Active Speaker Faces for Diarization in TV shows30 Mar 2022 0 repositories listed
-
24 Mar 2022 0 repositories listed
-
Density-Based Clustering with Kernel Diffusion11 Oct 2021 0 repositories listed
-
20 May 2021 0 repositories listed
-
Learning to Cluster Faces via Transformer23 Apr 2021 0 repositories listed
-
Efficient Large-Scale Face Clustering Using an Online Mixture of Gaussians31 Mar 2021 0 repositories listed
-
Orthogonal Subspace Decomposition: A New Perspective of Learning Discriminative Features for Face Clustering1 Jan 2021 0 repositories listed
-
A Clustering-Based Method for Automatic Educational Video Recommendation Using Deep Face-Features of Lecturers9 Oct 2020 0 repositories listed
-
Robust Character Labeling in Movie Videos: Data Resources and Self-supervised Feature Adaptation25 Aug 2020 0 repositories listed
-
Improving Face Recognition by Clustering Unlabeled Faces in the Wild14 Jul 2020 0 repositories listed
-
Density-Aware Feature Embedding for Face Clustering1 Jun 2020 0 repositories listed
-
Is an Affine Constraint Needed for Affine Subspace Clustering?8 May 2020 0 repositories listed
-
Clustering based Contrastive Learning for Improving Face Representations5 Apr 2020 0 repositories listed
-
Constructing the F-Graph with a Symmetric Constraint for Subspace Clustering17 Dec 2019 0 repositories listed
-
Subspace Clustering with Active Learning8 Nov 2019 0 repositories listed
-
Robust Subspace Clustering With Independent and Piecewise Identically Distributed Noise Modeling1 Jun 2019 0 repositories listed
-
Robust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization15 Sep 2017 0 repositories listed
-
Community Recovery in Hypergraphs12 Sep 2017 0 repositories listed
-
Face Clustering: Representation and Pairwise Constraints15 Jun 2017 0 repositories listed
-
Subspace Clustering via Optimal Direction Search12 Jun 2017 0 repositories listed
-
A Proximity-Aware Hierarchical Clustering of Faces14 Mar 2017 0 repositories listed
-
Outlier Cluster Formation in Spectral Clustering3 Mar 2017 0 repositories listed
-
Clustering with Hypergraphs: The Case for Large Hyperedges4 Oct 2016 0 repositories listed
-
Achieving stable subspace clustering by post-processing generic clustering results27 May 2016 0 repositories listed
-
Innovation Pursuit: A New Approach to Subspace Clustering2 Dec 2015 0 repositories listed
-
LogDet Rank Minimization with Application to Subspace Clustering3 Jul 2015 0 repositories listed
-
Diversity-Induced Multi-View Subspace Clustering1 Jun 2015 0 repositories listed
-
FaLRR: A Fast Low Rank Representation Solver1 Jun 2015 0 repositories listed
-
Greedy Subspace Clustering31 Oct 2014 0 repositories listed
-
Robust Subspace Segmentation with Block-diagonal Prior1 Jun 2014 0 repositories listed
-
Constrained Clustering and Its Application to Face Clustering in Videos1 Jun 2013 0 repositories listed
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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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