TY - GEN
T1 - An improved evolutionary algorithm for fundamental matrix estimation
AU - Li, Yi
AU - Velipasalar, Senem
AU - Gursoy, M. Cenk
PY - 2013
Y1 - 2013
N2 - The estimation of the fundamental matrix is an important problem in epipolar geometry. Many estimation methods have been proposed before, including the eight-point algorithm, Simple Evolutionary Agent (SEA) and RANSAC. In this paper, we investigate the evolutionary agent-based algorithm for fundamental matrix estimation, and present a new algorithm that improves the existing evolutionary algorithm both accuracy- and efficiency-wise. The model focuses on selecting a best combination of input points to compute the fundamental matrix via the eight-point algorithm. To improve the existing algorithm, our new model holds competition over all agents for population control and evolutionary experience accumulation. In addition to a larger competition scope, we add the outlier elimination mechanism, which greatly accelerates the algorithm. New parameters are introduced to control the convergence more efficiently. The improved algorithm achieves lower computation load and more accurate results. A general analysis about parameter selection is also provided.
AB - The estimation of the fundamental matrix is an important problem in epipolar geometry. Many estimation methods have been proposed before, including the eight-point algorithm, Simple Evolutionary Agent (SEA) and RANSAC. In this paper, we investigate the evolutionary agent-based algorithm for fundamental matrix estimation, and present a new algorithm that improves the existing evolutionary algorithm both accuracy- and efficiency-wise. The model focuses on selecting a best combination of input points to compute the fundamental matrix via the eight-point algorithm. To improve the existing algorithm, our new model holds competition over all agents for population control and evolutionary experience accumulation. In addition to a larger competition scope, we add the outlier elimination mechanism, which greatly accelerates the algorithm. New parameters are introduced to control the convergence more efficiently. The improved algorithm achieves lower computation load and more accurate results. A general analysis about parameter selection is also provided.
UR - http://www.scopus.com/inward/record.url?scp=84890879981&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890879981&partnerID=8YFLogxK
U2 - 10.1109/AVSS.2013.6636644
DO - 10.1109/AVSS.2013.6636644
M3 - Conference contribution
AN - SCOPUS:84890879981
SN - 9781479907038
T3 - 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance, AVSS 2013
SP - 226
EP - 231
BT - 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance, AVSS 2013
PB - IEEE Computer Society
T2 - 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance, AVSS 2013
Y2 - 27 August 2013 through 30 August 2013
ER -