Digital Services        F A Q

SCHOLARLY TALKS

Face Clustering at Scale

Dept. of Computer Science (June 19, 2017)
362









SEMINAR SERIES : Distinguished Lecture

MAJOR SPEAKER : Jain, Anil K.
LENGTH : 72 min.
ACCESS : Open to all
SUMMARY : Given a large collection of unlabeled face images, we address the problem of clustering faces into an unknown number of identities. This problem is of interest in social media, law enforcement, and other applications, where the number of faces can be of the order of hundreds of million, while the number of identities (clusters) can range from a few thousand to millions. To address the challenges of run-time complexity and cluster quality, we present an approximate Rank-Order clustering algorithm that performs better than popular clustering algorithms (k-Means and Spectral). Our experiments include clustering up to 123 million face images into over 10 million clusters. Clustering results are analyzed in terms of external (known face labels) and internal (unknown face labels) quality measures, and run-time. Our algorithm achieves an F-measure of 0.87 on the LFW benchmark (13K faces of 5, 749 individuals), which drops to 0.27 on the largest dataset considered (13K faces in LFW + 123M distractor images). Additionally, we show that frames in the YouTube video benchmark can be clustered with an F-measure of 0.71. An internal per-cluster quality measure is developed to rank individual clusters for manual exploration of high quality clusters that are compact and isolated.  [Go to the full record in the library's catalogue]



  ●  Persistent link: http://hkbutube.lib.hkbu.edu.hk/st/display.php?bibno=st795
  ●  XML Dublin Core code for metadata harvesting


Recommended for You


This video is presented here with the permission of the speakers. Any downloading, storage, reproduction, and redistribution are strictly prohibited without the prior permission of the respective speakers. Go to Full Disclaimer.

  For enquiries, please contact Digital and Multimedia Services Section




© 2009-2019 All rights reserved