Rapid shortest branch cutting search method based on improved genetic algorithm

A technology for improving genetic algorithm and search method, applied in the field of grating projection three-dimensional measurement, can solve the problems of easy self-closing, too long branch and tangent structure, etc., and achieve the effect of not easy self-closing, good phase unwrapping accuracy, and fast search and construction.

Active Publication Date: 2019-07-26
XIAN UNIV OF TECH
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the above-mentioned deficiencies in the prior art, the purpose of the present invention is to provide a fast shortest branch-cut search method based on the improved genetic algorithm, which solves the problem that the branch-cut line structure in the prior art is too long and is easy to self-enclose, and has a search speed Fast and good search ability

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
  • Rapid shortest branch cutting search method based on improved genetic algorithm
  • Rapid shortest branch cutting search method based on improved genetic algorithm
  • Rapid shortest branch cutting search method based on improved genetic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0073] See Figure 1(a)~(b), image 3 , the present invention proposes a fast shortest branch-cut search algorithm based on the improved genetic algorithm for the first time, which replaces the path in the traveling salesman problem with pairwise matching of positive and negative residual points, and is not easy to self-close the branch-cut line; adopts a method similar to the genetic algorithm The selection, crossover and mutation operators for global optimization, the fitness function is the Euclidean distance between the matching positive and negative residual points, where the chromosome sequence of the positive residual point is fixed, and the chromosome sequence of the negative residual point is continuously adjusted and optimized, And use the nearest neighbor algorithm to optimize the initial population to improve the convergence speed....

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 a rapid shortest branch cutting search method based on an improved genetic algorithm. The rapid shortest branch cutting search method comprises the following steps: step 1, identifying residual points, and carrying out quantity matching and residual point coding; step 2, generating an initial population of a negative residual point; step 3, selecting an operator; adopting anatural selection rule of survival of the fittest, taking a fitness function as an evaluation standard, and searching a chromosome sequence with the optimal fitness in the current group to replace kchromosome sequences with the worst fitness; 4, implementing a cross operator; step 5, implementing a mutation operator. The mutation operator is implemented with a mutation probability Pm, the principle is that two genes are randomly selected on the same chromosome sequence and interchanged, a new chromosome is generated after mutation to improve the population diversity, and similar to a cross operator, if the new sub-chromosome is more suitable, a parent chromosome is replaced by a quilt chromosome; otherwise, the parent chromosome is reserved, and the child chromosome is lost; the method has the characteristics of high search speed and good optimization capability.

Description

technical field [0001] The invention belongs to the technical field of grating projection three-dimensional measurement, and in particular relates to a fast shortest branch-cut search method based on an improved genetic algorithm. Background technique [0002] The branch cutting method is fast, does not produce error propagation, and reduces the error to a small range; and compared with the minimum norm method, the surface shape restoration consistency is better. When the number and distribution of residual points are constant, it is obvious that the shorter the total length of the constructed branch tangent line, the fewer good pixels will be occupied, so that there will be more expansion paths to choose from, especially the dense area of ​​residual points is more important . The Goldstein branch tangent construction method is local optimization, and its branch tangent length is not necessarily the shortest; and in the close area of ​​residual points, it is easy to form se...

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): G06N3/12G01B11/25
CPCG06N3/126G01B11/25Y02D10/00
Inventor 杨延西王建华张申华邓毅高异
Owner XIAN UNIV OF TECH
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