Face clustering method based on graph convolutional neural network

A technology of convolutional neural network and clustering method, applied in the direction of neural learning method, biological neural network model, neural architecture, etc., can solve the problems of affecting clustering efficiency, high time complexity, and high overlap of subgraphs, etc., to reduce The number of subgraphs, reducing the size of input data, and the effect of accurate reasoning

Pending Publication Date: 2022-05-17
HARBIN ENG UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the link prediction method also has the problem of high time complexity, especially in the face of large-scale face data sets
The link prediction method regards each face image as a node after extracting features, constructs a subgraph for each node as input, and uses a graph convolutional neural network to infer the subgraph to judge the connectivity between nodes, thereby obtaining clustering , however, the constructed subgraphs are highly overlapping, which not only causes redundant computing resource consumption, but also affects the efficiency of clustering

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Face clustering method based on graph convolutional neural network
  • Face clustering method based on graph convolutional neural network
  • Face clustering method based on graph convolutional neural network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0064] Step 1. Process the original face data set, extract face features, and regard each feature as a node. The original face data set is expressed as X=[x 1 ,x 2 ,...,x n ] T ∈ R N×D , where x i Represents the feature of the i-th node, N represents the number of pictures, and D represents the dimension of the feature.

[0065] Step 2. According to the feature extracted in step 1, use the nearest neighbor search to calculate the k nearest neighbor nodes of each node. After the node nearest neighbor search is completed, the density division operation can be performed next. First, the local density value of each node needs to be calculated. The specific calculation method of the local density value of the node is as follows:

[0066]

[0067] Among them, E 0 Indicates the preset cut-off distance, d ij Indicates the Euclidean distance between node i and node j, ρ i Indicates the local density value of node i, which is a measurement function, and the specific calcula...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention belongs to the technical field of face clustering, and particularly relates to a face clustering method based on a graph convolutional neural network. According to the method, firstly, feature extraction is performed on face data, face features are regarded as nodes, and local density values of all the nodes are calculated; then, the data is divided into high-density nodes and low-density nodes based on the local density value, and the high-density nodes are connected with the nodes which are high in density in the nearest neighbor to form a plurality of clustering centers; constructing a self-adaptive sub-graph for the low-density nodes, taking the self-adaptive sub-graph as the input of a graph convolutional neural network, and predicting the connectivity between the nodes; and finally, after the two parts are combined, edges which do not meet requirements are cut off by using pseudo-label propagation, and a final clustering result is obtained. According to the method, the data is divided into two parts based on the density, only the sub-graph is constructed for the low-density part for reasoning, the clustering efficiency is improved, meanwhile, the adaptive sub-graph can extract richer context information, reasoning on the sub-graph is more accurate, and the clustering accuracy is improved.

Description

technical field [0001] The invention belongs to the technical field of face clustering, and in particular relates to a face clustering method based on a graph convolutional neural network. Background technique [0002] With the development of science and technology, face recognition technology has gradually become popular and widely used in aerospace, entertainment, education, security and other fields, and the performance of face recognition technology has gradually improved. However, the current high accuracy of face recognition technology The efficiency depends on large-scale face annotation data sets. The more annotated face data sets, the better the effect. Although unlabeled data can be easily obtained from the Internet, manual annotation is not only time-consuming, but also expensive. In order to take advantage of these unlabeled data, face clustering methods are a good choice. [0003] At present, face clustering and technology are widely used. Some common scenarios...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06V40/16G06V10/762G06V10/764G06V10/82G06K9/62G06N3/04G06N3/08
CPCG06N3/08G06N3/047G06N3/045G06F18/2321G06F18/2415
Inventor 初妍李龙赵庆超莫士奇李思纯李松时洁
Owner HARBIN ENG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products