Fast Partial Search Solution to the 3D SFM Problem

Abstract

In this paper, we present a robust and computationally efficient technique for estimating the focus of expansion (FOE) of an optical flow field, using fast partial search. For each candidate location on a discrete sampling of the image area, we generate a linear system of equations for determining the remaining unknowns, viz. rotation and inverse depth. We compute the least squares error of the system without actually solving the equations, to generate an error surface that describes the goodness of fit across the hypotheses. Using Fourier techniques, we prove that given an N/spl times/N flow field, the FOE can be estimated in O(N/sup 2/logN) operations. Since the resulting system is linear, bounded performances in the data lead to bounded errors. In order to demonstrate its performance on real-world problems, we apply this technique for detecting obstacles in monocular navigation imagery.