37 research outputs found
Output Sensitive Algorithms for Approximate Incidences and Their Applications
An epsilon-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most epsilon from each other. Given a set of points and a set of objects, computing the approximate incidences between them is a major step in many database and web-based applications in computer vision and graphics, including robust model fitting, approximate point pattern matching, and estimating the fundamental matrix in epipolar (stereo) geometry.
In a typical approximate incidence problem of this sort, we are given a set P of m points in two or three dimensions, a set S of n objects (lines, circles, planes, spheres), and an error parameter epsilon>0, and our goal is to report all pairs (p,s) in P times S that lie at distance at most epsilon from one another. We present efficient output-sensitive approximation algorithms for quite a few cases, including points and lines or circles in the plane, and points and planes, spheres, lines, or circles in three dimensions. Several of these cases arise in the applications mentioned above. Our algorithms report all pairs at distance 1. Our algorithms are based on simple primal and dual grid decompositions and are easy to implement. We note though that (a) the use of duality, which leads to significant improvements in the overhead cost of the algorithms, appears to be novel for this kind of problems; (b) the correct choice of duality in some of these problems is fairly intricate and requires some care; and (c) the correctness and performance analysis of the algorithms (especially in the more advanced versions) is fairly non-trivial.
We analyze our algorithms and prove guaranteed upper bounds on their running time and on the "distortion" parameter alpha. We also briefly describe the motivating applications, and show how they can effectively exploit our solutions. The superior theoretical bounds on the performance of our algorithms, and their simplicity, make them indeed ideal tools for these applications. In a series of preliminary experimentations (not included in this abstract), we substantiate this feeling, and show that our algorithms lead in practice to significant improved performance of the aforementioned applications
SCOOP: Self-Supervised Correspondence and Optimization-Based Scene Flow
Scene flow estimation is a long-standing problem in computer vision, where
the goal is to find the 3D motion of a scene from its consecutive observations.
Recently, there have been efforts to compute the scene flow from 3D point
clouds. A common approach is to train a regression model that consumes source
and target point clouds and outputs the per-point translation vectors. An
alternative is to learn point matches between the point clouds concurrently
with regressing a refinement of the initial correspondence flow. In both cases,
the learning task is very challenging since the flow regression is done in the
free 3D space, and a typical solution is to resort to a large annotated
synthetic dataset. We introduce SCOOP, a new method for scene flow estimation
that can be learned on a small amount of data without employing ground-truth
flow supervision. In contrast to previous work, we train a pure correspondence
model focused on learning point feature representation and initialize the flow
as the difference between a source point and its softly corresponding target
point. Then, in the run-time phase, we directly optimize a flow refinement
component with a self-supervised objective, which leads to a coherent and
accurate flow field between the point clouds. Experiments on widespread
datasets demonstrate the performance gains achieved by our method compared to
existing leading techniques while using a fraction of the training data. Our
code is publicly available at https://github.com/itailang/SCOOP
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem
We consider the classical camera pose estimation problem that arises in many computer vision applications, in which we are given n 2D-3D correspondences between points in the scene and points in the camera image (some of which are incorrect associations), and where we aim to determine the camera pose (the position and orientation of the camera in the scene) from this data. We demonstrate that this posing problem can be reduced to the problem of computing epsilon-approximate incidences between two-dimensional surfaces (derived from the input correspondences) and points (on a grid) in a four-dimensional pose space. Similar reductions can be applied to other camera pose problems, as well as to similar problems in related application areas.
We describe and analyze three techniques for solving the resulting epsilon-approximate incidences problem in the context of our camera posing application. The first is a straightforward assignment of surfaces to the cells of a grid (of side-length epsilon) that they intersect. The second is a variant of a primal-dual technique, recently introduced by a subset of the authors [Aiger et al., 2017] for different (and simpler) applications. The third is a non-trivial generalization of a data structure Fonseca and Mount [Da Fonseca and Mount, 2010], originally designed for the case of hyperplanes. We present and analyze this technique in full generality, and then apply it to the camera posing problem at hand.
We compare our methods experimentally on real and synthetic data. Our experiments show that for the typical values of n and epsilon, the primal-dual method is the fastest, also in practice
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
International audienc
Geometric pattern matching for point sets in the plane under similarity transformations
(6 pp.)International audienc
Approximate input sensitive algorithms for point pattern matching
(7 pp.)International audienc