Sökning: onr:"swepub:oai:research.chalmers.se:b37afdb2-4a21-45be-aa9c-3609bc582c1c" >
Optimal relative po...
Optimal relative pose with unknown correspondences
-
- Fredriksson, Johan (författare)
- Lund University,Lunds universitet,Mathematical Imaging Group,Forskargrupper vid Lunds universitet,Lund University Research Groups
-
- Larsson, Viktor (författare)
- Lund University,Lunds universitet,Mathematical Imaging Group,Forskargrupper vid Lunds universitet,Lund University Research Groups
-
- Olsson, Carl (författare)
- Lund University,Lunds universitet,Mathematical Imaging Group,Forskargrupper vid Lunds universitet,Lund University Research Groups
-
visa fler...
-
- Kahl, Fredrik, 1972 (författare)
- Chalmers University of Technology,Lund University,Lunds universitet,Mathematical Imaging Group,Forskargrupper vid Lunds universitet,Lund University Research Groups
-
visa färre...
-
(creator_code:org_t)
- ISBN 9781467388511
- 2016
- 2016
- Engelska.
-
Ingår i: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781467388511 ; 2016-January, s. 1728-1736
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
https://lup.lub.lu.s...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas