Robust Three-View Triangulation Done Fast
Citations Over TimeTop 16% of 2014 papers
Abstract
Estimating the position of a 3-dimensional world point given its 2-dimensional projections in a set of images is a key component in numerous computer vision systems. There are several methods dealing with this problem, ranging from sub-optimal, linear least square triangulation in two views, to finding the world point that minimized the L2-reprojection error in three views. This leads to the statistically optimal estimate under the assumption of Gaussian noise. In this paper we present a solution to the optimal triangulation in three views. The standard approach for solving the three-view triangulation problem is to find a closed-form solution. In contrast to this, we propose a new method based on an iterative scheme. The method is rigorously tested on both synthetic and real image data with corresponding ground truth, on a midrange desktop PC and a Raspberry Pi, a low-end mobile platform. We are able to improve the precision achieved by the closed-form solvers and reach a speed-up of two orders of magnitude compared to the current state-of-the-art solver. In numbers, this amounts to around 300K triangulations per second on the PC and 30K triangulations per second on Raspberry Pi.
Related Papers
- → Evaluation of time-based ranging methods: Does the choice matter?(2017)13 cited
- → Performance Comparison of Asynchronous Ranging Algorithms(2009)13 cited
- → Ranging-Aided Ground Robot Navigation Using UWB Nodes at Unknown Locations(2022)4 cited
- → An Original Correction Method for Indoor Ultra Wide Band Ranging-based\n Localisation System(2016)4 cited
- → Ranging Sensor Fusion in LISA Data Processing: Treatment of Ambiguities, Noise, and On-Board Delays in LISA Ranging Observables(2023)