A clustering method, device, electronic device, and storage medium for similar background pictures
A technology of similar pictures and clustering methods, applied in the field of clustering methods of similar pictures with backgrounds, storage media, devices and electronic equipment, can solve the problem that pictures cannot be processed well, clustering algorithms cannot cope well, and affect the final result. results, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0047] See figure 1 , figure 1 It is a schematic flowchart of a clustering method for background similar pictures provided by an embodiment of the present invention. The embodiment of the present invention provides a clustering method for similar background pictures, and the clustering method for similar background pictures may specifically include steps 1 to 4, wherein:
[0048] Step 1. Construct an undirected graph G, wherein the undirected graph G is represented by an adjacency matrix, and the picture is a node of the undirected graph G.
[0049] Specifically, an adjacency matrix needs to be obtained first, and the adjacency matrix is used to represent a graph. The graph includes nodes and edges, and the graph represents the relationship between the nodes. It is assumed that the picture is a node of the graph, and the edge is the edge of the graph. The degree of correlation between pictures, the greater the degree of correlation, the greater the similarity between pictu...
Embodiment 2
[0085] See image 3 , image 3 It is a schematic diagram of a clustering device for background similar pictures provided by an embodiment of the present invention. The clustering device for pictures with similar backgrounds includes:
[0086] a building module for constructing an undirected graph G, wherein the undirected graph G is represented by an adjacency matrix, and the picture is a node of the undirected graph G;
[0087] The removal module is used to remove all nodes whose core degree is less than k0 in the undirected graph G to obtain several subgraphs G1, wherein the subgraph G1 is a strong relationship cluster, and k0 is the relationship between affinity and frequency the turning point of the graph;
[0088] The clustering module is configured to divide the first non-strong relationship node into the corresponding sub-graph G1 according to the high confidence threshold of the affinity and frequency relationship graph, wherein the high confidence threshold is the ...
Embodiment 3
[0093] See Figure 4 , Figure 4 It is a schematic structural diagram of an electronic device provided by an embodiment of the present invention. The electronic device 1100 includes: a processor 1101, a communication interface 1102, a memory 1103 and a communication bus 1104, wherein the processor 1101, the communication interface 1102, and the memory 1103 complete mutual communication through the communication bus 1104;
[0094] memory 1103 for storing computer programs;
[0095] The processor 1101 is configured to implement the above method steps when executing the computer program.
[0096] When the processor 1101 executes the computer program, the following steps are implemented:
[0097] Step 1, build undirected graph G, wherein, described undirected graph G is represented with adjacency matrix, and picture is the node of described undirected graph G;
[0098] Step 2. Remove all the nodes whose core degree is less than k0 in the undirected graph G to obtain several su...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


