Optimal relative pose with unknown correspondences

Johan Fredriksson, Viktor Larsson, Carl Olsson, Fredrik Kahl

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

Previous work on estimating the epipolar geometry of two views relies on being able to reliably match feature points based on appearance. In this paper, we go one step further and show that it is feasible to compute both the epipolar geometry and the correspondences at the same time based on geometry only. We do this in a globally optimal manner. Our approach is based on an efficient branch and bound technique in combination with bipartite matching to solve the correspondence problem. We rely on several recent works to obtain good bounding functions to battle the combinatorial explosion of possible matchings. It is experimentally demonstrated that more difficult cases can be handled and that more inlier correspondences can be obtained by being less restrictive in the matching phase.

Original languageEnglish
Title of host publication2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016
PublisherIEEE Computer Society
Pages1728-1736
Number of pages9
Volume2016-January
ISBN (Electronic)9781467388511
Publication statusPublished - 2016
Event2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016 - Las Vegas, United States
Duration: 2016 Jun 262016 Jul 1

Conference

Conference2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016
Country/TerritoryUnited States
CityLas Vegas
Period2016/06/262016/07/01

Subject classification (UKÄ)

  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Optimal relative pose with unknown correspondences'. Together they form a unique fingerprint.

Cite this