Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Ant colony graph matching method based on G-W distance

A matching method, G-W technology, applied in the field of image processing, which can solve the problems of dependence, unstable optimization results, and low matching efficiency.

Active Publication Date: 2020-10-02
JILIN UNIV
View PDF7 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The main reason is that the existing numerical iterative convergence optimization depends on the selection of the initial point, and it is easy to fall into a local solution, the calculation cost is high, and the data under noise interference will produce large errors during the calculation process.
This leads to low matching efficiency and unstable optimization results

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
  • Ant colony graph matching method based on G-W distance
  • Ant colony graph matching method based on G-W distance
  • Ant colony graph matching method based on G-W distance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0081] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments.

[0082] Figure 7 An implementation flowchart of an ant colony pattern matching method based on G-W distance is provided for an embodiment of the present invention. In this embodiment, take the 3D model of a man and a horse as an example ( figure 1 ) illustrates the implementation of a G-W distance-based ant colony pattern matching method. Such as Figure 7 As shown, a kind of ant colony pattern matching method based on G-W distance provided by the embodiment of the present invention includes:

[0083] Step 100, selecting feature points for the two 3D non-rigid transformation graphics X and Y to be matched, including the following process:

[0084] First, at a given time t, calculate the HKS values ​​of all vertices on the triangular mesh to be matched, and extract the values ​​satisfying k t (x, x)>k t (x i , x i ) feature point x into...

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 relates to an ant colony graph matching method based on a G-W distance. The method comprises the following steps: selecting feature points of a to-be-matched graph; generating an H matrix under a G-W distance through the sampling information data of the feature points; establishing a secondary convex optimization model for the minimum difference degree of the G-W distance between thefeature points, and proposing the hypothesis of the model in combination with the ant colony; stipulating physical constraint conditions of the ant colony in a G-W distance minimum difference degreeoptimization process, so that the ant colony meets a one-to-one correspondence matching principle; accumulating distances among city nodes traversed by ants; optimizing the quadratic convex optimization problem under the G-W distance, and solving a shortest path and city nodes on the path; and defining the shortest path as the overall difference degree between the two manifold curved surfaces, andcalculating the matching relationship between the feature points by utilizing the relationship between the city nodes on the shortest path and the serial numbers of the feature points to complete graph matching. The method is the optimal solution closest to the real theory, and the dependence of traditional numerical iteration optimization on the initial solution is overcome.

Description

technical field [0001] The invention belongs to the technical field of image processing, specifically a G-W distance-based ant colony pattern matching method, and relates to computer graphics, computer vision, and robotics. Background technique [0002] Graph matching has always been a hot issue in the fields of computer graphics, computer vision, and robotics. At present, the research methods for 3D pattern matching mainly include skeleton matching method, sparse matching method, numerical iterative convergence matching method, and geometric distance optimization matching method. value. For example, when using a robot to create a map, multiple robots need to collect information together, and finally synthesize the sub-maps collected by each robot into a common map, which is a huge and complicated job. In this process, the method of landmark matching is required to realize the fusion of multiple maps, so any landmark matching error will have a great impact on the accuracy ...

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): G06T7/00G06K9/62G06F30/20G06N3/00G06F111/04G06F111/08
CPCG06T7/0002G06F30/20G06N3/006G06F2111/04G06F2111/08G06F18/22
Inventor 张洁琳张露李瑛
Owner JILIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products