Effective and Generalizable Graph-Based Clustering for Faces in the Wild

Figure 4

Proposed face clustering method overview. (a) Faces graph. Each vertex represents a face, and an edge is drawn between faces with distance less than a given threshold. (b) Initial clustering result. Each cluster is delimited by dotted lines. (c) Graph obtained by considering each CW cluster as a vertex and drawing an edge between two clusters if they are neighbors. (d) Clustering resulting from processing the graph in Figure 4(c), using the CW algorithm. (e) Final clustering obtained.

(a)

(b)

(c)

(d)

(e)