CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Optimal relative pose with unknown correspondences

Johan Fredriksson ; Viktor Larsson ; Carl Olsson ; Fredrik Kahl (Institutionen för signaler och system, Bildanalys och datorseende)
2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, United States, 26 - 1 July 2016 (1063-6919). Vol. 2016-January (2016), p. 1728-1736.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2016-12-19. Senast ändrad 2017-06-22.
CPL Pubid: 246225


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Bildanalys och datorseende (2013-2017)


Datorseende och robotik (autonoma system)

Chalmers infrastruktur