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

Efficient algorithms for robust estimation of relative translation

Johan Fredriksson ; Viktor Larsson ; Carl Olsson ; Olof Enqvist (Institutionen för signaler och system, Bildanalys och datorseende) ; Fredrik Kahl (Institutionen för signaler och system, Bildanalys och datorseende)
Image and Vision Computing (0262-8856). Vol. 52 (2016), p. 114.
[Artikel, refereegranskad vetenskaplig]

One of the key challenges for structure from motion systems in order to make them robust to failure is the ability to handle outliers among the correspondences. In this paper we present two new algorithms that find the optimal solution in the presence of outliers when the camera undergoes a pure translation. The first algorithm has polynomial-time computational complexity, independently of the amount of outliers. The second algorithm does not offer such a theoretical complexity guarantee, but we demonstrate that it is magnitudes faster in practice. No random sampling approaches such as RANSAC are guaranteed to find an optimal solution, while our two methods do. We evaluate and compare the algorithms both on synthetic and real experiments. We also embed the algorithms in a larger system, where we optimize for the rotation angle as well (the rotation axis is measured by other means). The experiments show that for problems with a large amount of outliers, the RANSAC estimates may deteriorate compared to our optimal methods.

Nyckelord: Branch and bound; Epipolar geometry; Structure from motion; Two-view geometry

Denna post skapades 2016-07-05. Senast ändrad 2016-10-19.
CPL Pubid: 238963


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)



Chalmers infrastruktur