Supercharge Your Innovation With Domain-Expert AI Agents!

Iterative bidirectional connection clustering algorithm for face image

A face image and clustering algorithm technology, applied in the field of image processing, can solve problems such as poor clustering effect, complex design of density estimation function, and inability to perform effective processing, and achieve the effect of multi-optimal cluster structure

Pending Publication Date: 2021-05-07
XUZHOU NORMAL UNIVERSITY
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the clustering algorithms currently used in the field of face image recognition have the following problems: (1) the design of the density estimation function is complex, and when the data points of the face image set are not evenly distributed, it cannot be processed effectively; (2) Clustering is poor when the collection of images has a long and thin distribution

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
  • Iterative bidirectional connection clustering algorithm for face image
  • Iterative bidirectional connection clustering algorithm for face image
  • Iterative bidirectional connection clustering algorithm for face image

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] An iterative bidirectional connection clustering algorithm for face image recognition, comprising the following steps:

[0052] Step 1: Calculate the face image distance matrix

[0053] Extract face features, extract any two images x from the face image dataset X i and x j , calculate the Euclidean distance between two images according to formula (1);

[0054] d(x i ,x j )=||x i -x j || 2 (1)

[0055] Among them, 1≤i≤n, 1≤j≤n;

[0056] Step 2: Calculate the shared neighbor similarity between images

[0057] Get any two images x according to formula (2) i and x j Shared Nearest Neighbor (SNN for short) between

[0058] SNN k (x i ,x j )={x l |x l ∈ N k (x i )∩x l ∈ N k (x j )} (2)

[0059] where k represents the number of neighbors, N k (x i ) represents the image x i The set of k nearest neighbors, N k (x j ) represents the image x j The set of k nearest neighbors;

[0060] Calculate the image x according to the shared neighbor similarity ...

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 discloses an iterative two-way connection clustering algorithm for face image recognition, which aims at the characteristic of high overlapping of face image data, adopts a data falling strategy on the basis of density clustering, finds out core data in an image data set, completes clustering work of the core data, and finally adopts a two-way connection mode to realize distribution operation of falling data. The method is characterized by comprising the following steps: calculating a distance matrix of a face image according to a formula; calculating shared neighbor similarity among the images; performing an iterative shedding process of the data to discover core data; core data clustering is completed; and completing the distribution of the remaining data through a bidirectional connection criterion. According to the iterative bidirectional connection clustering algorithm for face image recognition, each cluster is represented by a unique color, the outliers are represented by gray, the outliers are better judged, and more correct and more optimal cluster structures can be generated compared with an existing algorithm.

Description

technical field [0001] The invention relates to the field of image processing, in particular to an iterative bidirectional connection clustering algorithm for face image recognition. Background technique [0002] Face recognition is one of the research directions in the field of image recognition, which has very broad application prospects. Face recognition technology mainly includes three processes: face detection, face feature extraction and face recognition. However, with the increase in the "volume" of face databases and the increase in the requirements for "speed" of recognition, as well as the characteristics of non-uniform distribution of face image data points, traditional retrieval strategies are very time-consuming, which is not conducive to efficient recognition of face image features . [0003] Cluster analysis is an important method of data analysis. Its essence is to group data according to their characteristics, so that the similarity of data in the group is...

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
IPC IPC(8): G06K9/62G06K9/00
CPCG06V40/168G06F18/23
Inventor 杜明晶国艺璇瞿欢添王茹朱俊盛锦超
Owner XUZHOU NORMAL UNIVERSITY
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More