This site uses cookies. By continuing to use this site you agree to our use of cookies. To find out more, see our Privacy and Cookies policy.
Paper The following article is Open access

Similar Graph Face Clustering Based on Graph Convolutional Neural Network

, and

Published under licence by IOP Publishing Ltd
, , Citation Mingming Fang et al 2023 J. Phys.: Conf. Ser. 2589 012013 DOI 10.1088/1742-6596/2589/1/012013

1742-6596/2589/1/012013

Abstract

Face clustering is primarily a method for grouping a large number of face images and has important applications in the fields of label-free face image annotation and image management. Traditional machine learning clustering algorithms do not work well on face image data and are unable to learn effectively on complex face image features. Recent research has turned to the use of graph convolutional neural networks (GCNs) to learn contextual information from neighbourhood features between face images for inference, which can significantly improve performance. Unlike the conventional link prediction of face data points and confidence prediction between vertices by using GCNs, for this paper a similarity graph based face clustering algorithm is proposed. Construction of subgraphs by K-nearest neighbour algorithm, Learn the similarity between the k-nearest neighbor subgraphs of each face instance by constructing subgraphs with the k-nearest neighbor algorithm. Using a bottom-up clustering strategy to merge subgraphs to complete the clustering, this algorithm improves the clustering results on complex face features by 20% and 7% compared to traditional machine learning methods such as K-means and DBSCAN respectively, improving the clustering accuracy and reducing the computational complexity.

Export citation and abstract BibTeX RIS

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Please wait… references are loading.
10.1088/1742-6596/2589/1/012013