Rapid shortest branch cutting search method based on improved genetic algorithm

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...

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

Images