mlsanityData to 14 Oct 2026

VideoClusterNet: Self-Supervised and Adaptive Face Clustering For Videos

arXiv 2407.12214 ↗First posted 16 Jul 2024cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

With 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 group together detected video face tracks with common facial identities. This problem is very challenging due to the large range of pose, expression, appearance, and lighting variations of a given face across video frames. Generic pre-trained Face Identification (ID) models fail to adapt well to the video production domain, given its high dynamic range content and also unique cinematic style. Furthermore, traditional clustering algorithms depend on hyperparameters requiring individual tuning across datasets. In this paper, we present a novel video face clustering approach that learns to adapt a generic face ID model to new video face tracks in a fully self-supervised fashion. We also propose a parameter-free clustering algorithm that is capable of automatically adapting to the finetuned model's embedding space for any input video. Due to the lack of comprehensive movie face clustering benchmarks, we also present a first-of-kind movie dataset: MovieFaceCluster. Our dataset is handpicked by film industry professionals and contains extremely challenging face ID scenarios. Experiments show our method's effectiveness in handling difficult mainstream movie scenes on our benchmark dataset and state-of-the-art performance on traditional TV series datasets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 65 references that are in the map. First posted on arXiv 16 Jul 2024.

Builds on

25 of 65 references.

References · 25

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  5. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  6. 2019Contrastive Multiview Codingcited by 1,301
  7. 2017VGGFace2: A dataset for recognising faces across pose and agecited by 914
  8. 2022AdaFace: Quality Adaptive Margin for Face Recognitioncited by 391
  9. 2022BoT-SORT: Robust Associations Multi-Pedestrian Trackingcited by 320
  10. 2015MovieQA: Understanding Stories in Movies through Question-Answeringcited by 304
  11. 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
  12. 2021General Facial Representation Learning in a Visual-Linguistic Mannercited by 195
13 more
  1. 2016Movie Descriptioncited by 181
  2. 2020SER-FIQ: Unsupervised Estimation of Face Image Quality Based on Stochastic Embedding Robustnesscited by 112
  3. 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
  4. 2017MovieGraphs: Towards Understanding Human-Centric Situations from Videoscited by 67
  5. 2022Mugs: A Multi-Granular Self-Supervised Learning Frameworkcited by 54
  6. 2020Clustering based Contrastive Learning for Improving Face Representationscited by 21
  7. 2019Video Face Clustering with Unknown Number of Clusterscited by 17
  8. 2019Video Face Recognition: Component-wise Feature Aggregation Network (C-FAN)cited by 13
  9. 2019Self-Supervised Learning of Face Representations for Video Face Clusteringcited by 11
  10. 2018Unsupervised Learning of Face Representationscited by 4
  11. 2020Robust Character Labeling in Movie Videos: Data Resources and Self-supervised Feature Adaptationcited by 3
  12. 2022Self-supervised Video-centralised Transformer for Video Face Clusteringcited by 3
  13. 2020Unique Faces Recognition in Videoscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.