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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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 ...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com