Model-based image interpretation using genetic algorithms
Image and Vision Computing - Special issue: BMVC 1991
Efficiently Locating Objects Using the Hausdorff Distance
International Journal of Computer Vision
Finite Markov chain results in evolutionary computation: a tour d'horizon
Fundamenta Informaticae
A discipline of evolutionary programming
Theoretical Computer Science - Special issue on algorithmic learning theory
Geometric Primitive Extraction Using a Genetic Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
A species conserving genetic algorithm for multimodal function optimization
Evolutionary Computation
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Genetic object recognition using combinations of views
IEEE Transactions on Evolutionary Computation
Bounds for probability of success of classical genetic algorithm based on hamming distance
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The genetic algorithm is a simple and interesting optimization method for a wide variety of computer vision problems. However, its performance is often brittle and degrades drastically with increasing input problem complexity. While this problem is difficult to overcome due to the stochastic nature of the algorithm, this paper shows that a robust statistical design using sequential sampling, repeated independent trials and hypothesis testing can be used to greatly alleviate the degradation. The working principle is as follows: The probability of success P of a stochastic algorithm A (in this case A is the genetic algorithm) can be estimated by running N copies of A simultaneously or running A repeatedly N times. Such a scheme is generally referred to as the parallel or repeated (genetic) algorithm. By hypothesis testing, P can be tested with a required figure of merit (i.e. the level of significance). This is used in turn to adjust N in an iterative scheme to maintain a constant P"r"e"p"e"a"t"e"d, achieving a robust feedback loop. Experimental results on both synthetic and real images are reported on the application of this novel algorithm to an affine object detection problem and a free form 3D object registration problem.