Constrained video face clustering using 1NN relations

In this work, we introduce the Constrained first nearest neighbour Clustering (C1C) method for video face clustering. Using the premise that the first nearest neighbour (1NN) of an instance is sufficient to discover large chains and groupings, C1C builds upon the hierarchical clustering method FINCH...

Täydet tiedot

Bibliografiset tiedot
Päätekijät: Kalogeiton, V, Zisserman, A
Aineistotyyppi: Conference item
Kieli:English
Julkaistu: 2020
_version_ 1826263385897959424
author Kalogeiton, V
Zisserman, A
author_facet Kalogeiton, V
Zisserman, A
author_sort Kalogeiton, V
collection OXFORD
description In this work, we introduce the Constrained first nearest neighbour Clustering (C1C) method for video face clustering. Using the premise that the first nearest neighbour (1NN) of an instance is sufficient to discover large chains and groupings, C1C builds upon the hierarchical clustering method FINCH by imposing must-link and cannot-link constraints acquired in a self-supervised manner. We show that adding these constraints leads to performance improvements with low computational cost. C1C is easily scalable and does not require any training. Additionally, we introduce a new Friends dataset for evaluating the performance of face clustering algorithms. Given that most video datasets for face clustering are saturated or emphasize only the main characters, the Friends dataset is larger, contains identities for several main and secondary characters, and tackles more challenging cases as it labels also the ‘back of the head’. We evaluate C1C on the Big Bang Theory, Buffy, and Sherlock datasets for video face clustering, and show that it achieves the new state of the art whilst setting the baseline on Friends.
first_indexed 2024-03-06T19:50:56Z
format Conference item
id oxford-uuid:23f369b3-794b-42a6-a6af-ab4b0d726ba4
institution University of Oxford
language English
last_indexed 2024-03-06T19:50:56Z
publishDate 2020
record_format dspace
spelling oxford-uuid:23f369b3-794b-42a6-a6af-ab4b0d726ba42022-03-26T11:47:06ZConstrained video face clustering using 1NN relationsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:23f369b3-794b-42a6-a6af-ab4b0d726ba4EnglishSymplectic Elements2020Kalogeiton, VZisserman, AIn this work, we introduce the Constrained first nearest neighbour Clustering (C1C) method for video face clustering. Using the premise that the first nearest neighbour (1NN) of an instance is sufficient to discover large chains and groupings, C1C builds upon the hierarchical clustering method FINCH by imposing must-link and cannot-link constraints acquired in a self-supervised manner. We show that adding these constraints leads to performance improvements with low computational cost. C1C is easily scalable and does not require any training. Additionally, we introduce a new Friends dataset for evaluating the performance of face clustering algorithms. Given that most video datasets for face clustering are saturated or emphasize only the main characters, the Friends dataset is larger, contains identities for several main and secondary characters, and tackles more challenging cases as it labels also the ‘back of the head’. We evaluate C1C on the Big Bang Theory, Buffy, and Sherlock datasets for video face clustering, and show that it achieves the new state of the art whilst setting the baseline on Friends.
spellingShingle Kalogeiton, V
Zisserman, A
Constrained video face clustering using 1NN relations
title Constrained video face clustering using 1NN relations
title_full Constrained video face clustering using 1NN relations
title_fullStr Constrained video face clustering using 1NN relations
title_full_unstemmed Constrained video face clustering using 1NN relations
title_short Constrained video face clustering using 1NN relations
title_sort constrained video face clustering using 1nn relations
work_keys_str_mv AT kalogeitonv constrainedvideofaceclusteringusing1nnrelations
AT zissermana constrainedvideofaceclusteringusing1nnrelations