A genetic algorithm for the detection of 2D geometric primitives in images
暂无分享,去创建一个
We investigate the use of genetic algorithms (GAs) for image primitives extraction (such as segments, circles, ellipses or quadrilaterals). This approach completes the well-known Hough transform, in the sense that GAs are efficient when the Hough approach becomes too expensive in memory, i.e. when we search for complex primitives having more than 3 or 4 parameters. A GA is a stochastic technique, relatively slow, but which provides with an efficient tool to search in a high dimensional space. The philosophy of the method is very similar to the Hough transform, which is to search an optimum in a parameter space. However, we will see that the implementation is different.
[1] José Carlos Príncipe,et al. A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm , 1991, ICGA.
[2] David E. Goldberg,et al. Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.
[3] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[4] M. Levine,et al. Extracting geometric primitives , 1993 .