Face Clustering: Representation and Pairwise Constraints
Clustering face images according to their identity has two important applications: (i) grouping a collection of face images when no external labels are associated with images, and (ii) indexing for efficient large scale face retrieval. The clustering problem is composed of two key parts: face representation and choice of similarity for grouping faces. We first propose a representation based on ResNet, which has been shown to perform very well in image classification problems. Given this representation, we design a clustering algorithm, Conditional Pairwise Clustering (ConPaC), which directly estimates the adjacency matrix only based on the similarity between face images. This allows a dynamic selection of number of clusters and retains pairwise similarity between faces. ConPaC formulates the clustering problem as a Conditional Random Field (CRF) model and uses Loopy Belief Propagation to find an approximate solution for maximizing the posterior probability of the adjacency matrix. Experimental results on two benchmark face datasets (LFW and IJB-B) show that ConPaC outperforms well known clustering algorithms such as k-means, spectral clustering and approximate rank-order. Additionally, our algorithm can naturally incorporate pairwise constraints to obtain a semi-supervised version that leads to improved clustering performance. We also propose an k-NN variant of ConPaC, which has a linear time complexity given a k-NN graph, suitable for large datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringFace Clusteringimage-classificationImage ClassificationRetrievalMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Constrained Clustering and Its Application to Face Clustering in Videos
In this paper, we focus on face clustering in videos. Given the detected faces from real-world videos, we partition all faces into K disjoint clusters. Different from clustering on a collection of facial images, the face…
ClusteringConstrained ClusteringFace ClusteringSemi-Supervised Subspace Clustering via Tensor Low-Rank Representation
In this letter, we propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. By representing t…
ClusteringClustering-driven Deep Embedding with Pairwise Constraints
Recently, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart …
ClusteringCOBRA: A Fast and Simple Method for Active Clustering with Pairwise Constraints
Clustering is inherently ill-posed: there often exist multiple valid clusterings of a single dataset, and without any additional information a clustering system has no way of knowing which clustering it should produce. T…
ClusteringvalidA probabilistic constrained clustering for transfer learning and image category discovery
Neural network-based clustering has recently gained popularity, and in particular a constrained clustering formulation has been proposed to perform transfer learning and image category discovery using deep learning. The …
ClusteringConstrained ClusteringDeep ClusteringEcg Risk Stratification+1