Robust epipolar geometry estimation using genetic algorithm1
Introduction
Matching different views of a single scene remains one of the most difficult problems in computer vision. Two images of the same scene are related by the epipolar geometry constraint, which is the only geometrical constraint available regardless of specific objects. In this way, epipolar geometry plays an important role in stereo vision. Its recent applications cover 3D reconstruction (Faugeras, 1992; Shashua, 1993), camera self-calibration (Maybank and Faugeras, 1992; Ma, 1996), stereo analysis (Hartley and Gupta, 1993; Robert and Hebert, 1993), motion segmentation (Nishimura et al., 1990; Sinclair et al., 1994), image synthesis (Laveau and Faugeras, 1994), etc. Epipolar geometry between two uncalibrated images can be computed by a certain number of corresponding points. A great deal of literature exists on this subject (Longuet-Higgins, 1981; Zhang et al., 1995; Hartley, 1995; Xu and Zhang, 1996). The common methods generally fall into three categories: linear method, nonlinear iterative method, and robust estimation method, such as M-estimator or LMedS.
In most applications, the corresponding points are inevitably corrupted by outliers and noise, such as false matches and badly located points. Hence robustness to outliers is not trivial if algorithms can be utilized in engineering and scientific problems. By robustness, we mean that the performance of algorithm should not be affected significantly by small deviations from the assumed model and it should not deteriorate drastically due to outlier and noise. M-estimator or LMedS is more robust than two other methods since the influence of outliers has been reduced in M-estimator or they are simply discarded in LMedS. However, these two approaches work poorly when outlier proportion is higher than a half.
Robust parameter estimation is usually formulated as a non-convex optimization problem. In the past few years, the optimization technique is primarily based on gradient descent or random sample. Gradient descent can become stuck into local minima easily, which is far away from the true global optimum. Random sample, upon which almost all of highly robust estimator based, can avoid the local minima in some extent. But it is potentially time-consuming particularly when a large number of outliers are involved. Another drawback for random sample lies in the fact that outlier proportion often can not be known in advance. Thus it is difficult for this technique to determine how many subsamples are required to guarantee finding global optimum.
The aim of this paper is how to use genetic algorithm to alleviate the above problems. Genetic algorithm is a global optimization algorithm, which can effectively avoid falling in local minima. Besides, unlike random sample, GA has a good criterion for convergence. Finally, as we will demonstrate later GA is more efficient than random sample in computation efficiency. The rest of this paper is organized as follows. In Section 2, we first introduce the epipolar geometry constraints under full perspective, and then show how to formulate robust parameter estimation into a global optimization problem. Section 3gives a brief review of genetic algorithm. The application of GA in the robust epipolar geometry estimation is presented in Section 4. In Section 5, we give our experiment's results in detail. We conclude our paper in Section 6.
Section snippets
Problem formulation
In this section the epipolar geometry is first introduced. Neither the intrinsic parameters of the images nor the extrinsic parameters are assumed to be known. Then, we will formulate robust epipolar geometry estimation as a global optimization problem.
Genetic algorithm: a review
Genetic algorithm (Holland, 1975; Goldberg, 1989; Michalewicz, 1992) is a stochastic optimization technique that mimics the principles of natural evolution. Its recent applications in computer vision include adaptive image segmentation (Bhanu et al., 1995); edge detection (Bhandarkar et al., 1994); morphological filter design (Harvey and Marshall, 1996), etc.
According to the genetic evolution theory, stronger and fitter individuals have better chances of survival than weaker ones. Offsprings
Genetic algorithm: application in epipolar geometry estimation
The input to our algorithm is corresponding points set , where parameter vector represents corresponding point. The output is the best minimal subset and an inlier subset that is consistent with this minimal subset.
Experimental results
In this section, we present experimental results using genetic algorithm with epipolar geometry estimation under full perspective. To compute the quality of the estimated fundamental matrix , we use the following evaluation formula:where Nin is the number of all the inliers, d is the point-to-line Euclidean distance expressed in pixels.
Note. This evaluation formula is carried out using all matched points, except outliers, and not just the ones that were used to
Conclusion
In this paper, we propose a generic robust parameter estimation method. Its application in epipolar geometry estimation is then reported. We also make the detailed comparison between our methods and other typical existing methods in this specific problem. Comparing with previous approaches, the proposed one has the following main advantages:
- •
It is very robust to outliers. In fact, as long as the number of inliers is higher than the minimum number to give a unique solution, our approach can
References (22)
- et al.
Scene recognition using genetic algorithms with sematic nets
Pattern Recognition Letters
(1990) - et al.
An edge detection technique using genetic algorithm-based optimization
Pattern Recognition
(1994) - et al.
The use of genetic algorithms in morphological filter design
Signal Processing: Image Communication
(1996) - et al.
A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry
Artificial Intelligence
(1995) - Bhanu, B., Lee, S., Ming, J., 1995. Adaptive image segmentation using a genetic algorithm. IEEE Trans. Systems Man...
- Faugeras, O.D., 1992. What can be seen in the three dimensions with an uncalibrated stereo rig?. In: Sandini, G. (Ed.),...
- Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading,...
- Harris, C., 1987. A combined corner and edge detection. In: Proc. Alvey...
- Hartley, R.I., 1995. In defence of the 8-point algorithm. In: Proc. 5th Internat. Conf. on Computer Vision, Boston, MA,...
- Hartley, R.I., Gupta, R., 1993. Computing matched-epipolar projections. In: Proc. Conf. on Computer Vision and Pattern...
Cited by (36)
Novel adaptive genetic algorithm sample consensus
2019, Applied Soft Computing JournalCitation Excerpt :One of the first usages of the genetic algorithms in computer vision is presented in the Saito and Mori [23] paper in stereo matching. As the benefits of genetic algorithms were revealed, researchers utilized this technique in other contexts of computer vision as well [24–27]. GASAC [6] was one of the first forms of the evolutionary approaches in the RANSAC algorithm.
Robust trifocal tensor constraints for structure from motion estimation
2013, Pattern Recognition LettersCitation Excerpt :Genetic algorithms (GA) are often used for parameter estimations. Chai and Ma (1998) and Tang et al. (2008) applied GA to estimate the fundamental matrix. Hu et al. (2003) also implemented the trifocal tensor estimation using GA.
Fundamental matrix estimation by multiobjective genetic algorithm with Taguchi's method
2012, Applied Soft Computing JournalCitation Excerpt :If the eight pairs of corresponding points are known, we can compute the parameters of the fundamental matrix. With more than eight points, a linear least squares minimization problem is to be solved [3,15,20]. Traditional bucketized algorithms divide the plane into some non-overlapping areas [20], and then select one point from each area.
Epipolar geometry estimation based on evolutionary agents
2008, Pattern RecognitionQuaternion wavelet phase based stereo matching for uncalibrated images
2007, Pattern Recognition Letters
- 1
This work was partially supported by the Chinese National Science Foundation, the Chinese National Key Project for Basic Researchers, and the Chinese National High Technology Program (863).