- Category:
- AI-NN-PR
- Tags:
-
[PDF]
- File Size:
- 165.22kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- xqx830921
Description: The application of genetic algorithm in curve polygon approximation
In the polygon approximation of planar digital curves, in order to overcome the vertex detection, it only depends on the local area and the weakness of global information
The problem of shape approximation is optimized to find the minimum number of vertices and minimize the number of vertices and approximate errors under certain approximate error conditions
In order to be able to deal with more points, genetic algorithm and improved genetic algorithm based on Pareto optimal solution are used to approximate the most
The experimental comparison of some classical algorithms shows that the algorithm is more realistic and efficient than a class of algorithms that rely only on the local characteristics of the curve
There are obvious improvements, and there are significant time savings for algorithms such as dynamic programming, such as dynamic programming.
- [search_GA] - This is the use of genetic algorithm sea
- [ZDT4] - For effective application of genetic alg
- [fouriormiaoshuzi] - In matlab environment, using Fourier des
- [dp] - I wanted to learn dynamic programming re
- [nozzle-shock] - Sprinkler irrigation to be one-dimension
- [pmew2d] - Two-dimensional supersonic flow numerica
- [FoURIER] - Fourier descriptor is one of the importa
- [TestMCAZero] - Least-squares fitting tools, and to be a
- [TSPGA_src] - Improved Genetic Algorithm in TSP applic
File list (Check if you may need any files):
Download