Table of Contents
Fetching ...

Simulator HC: Regression-based Online Simulation of Starting Problem-Solution Pairs for Homotopy Continuation in Geometric Vision

Xinyue Zhang, Zijia Dai, Wanting Xu, Laurent Kneip

TL;DR

This work tackles the challenge of solving hard polynomial systems in geometric vision by replacing exhaustive polynomial-solver templates with a learnable starting point coupled to an online simulator. A regression network predicts an approximate solution from correspondences, while an online simulator generates a consistent starting problem that enables single-root homotopy continuation to reach the target solution. The approach, termed Simulator HC, achieves high success rates and substantial speedups on generalized camera resectioning and the generalized relative pose and scale problem, including real-world data, and integrates well with RANSAC. The key contribution is a general, simulation-trained starting-pair paradigm that pairs learning with HC to produce efficient, robust solvers for complex geometric problems.

Abstract

While automatically generated polynomial elimination templates have sparked great progress in the field of 3D computer vision, there remain many problems for which the degree of the constraints or the number of unknowns leads to intractability. In recent years, homotopy continuation has been introduced as a plausible alternative. However, the method currently depends on expensive parallel tracking of all possible solutions in the complex domain, or a classification network for starting problem-solution pairs trained over a limited set of real-world examples. Our innovation lies in a novel approach to finding solution-problem pairs, where we only need to predict a rough initial solution, with the corresponding problem generated by an online simulator. Subsequently, homotopy continuation is applied to track that single solution back to the original problem. We apply this elegant combination to generalized camera resectioning, and also introduce a new solution to the challenging generalized relative pose and scale problem. As demonstrated, the proposed method successfully compensates the raw error committed by the regressor alone, and leads to state-of-the-art efficiency and success rates.

Simulator HC: Regression-based Online Simulation of Starting Problem-Solution Pairs for Homotopy Continuation in Geometric Vision

TL;DR

This work tackles the challenge of solving hard polynomial systems in geometric vision by replacing exhaustive polynomial-solver templates with a learnable starting point coupled to an online simulator. A regression network predicts an approximate solution from correspondences, while an online simulator generates a consistent starting problem that enables single-root homotopy continuation to reach the target solution. The approach, termed Simulator HC, achieves high success rates and substantial speedups on generalized camera resectioning and the generalized relative pose and scale problem, including real-world data, and integrates well with RANSAC. The key contribution is a general, simulation-trained starting-pair paradigm that pairs learning with HC to produce efficient, robust solvers for complex geometric problems.

Abstract

While automatically generated polynomial elimination templates have sparked great progress in the field of 3D computer vision, there remain many problems for which the degree of the constraints or the number of unknowns leads to intractability. In recent years, homotopy continuation has been introduced as a plausible alternative. However, the method currently depends on expensive parallel tracking of all possible solutions in the complex domain, or a classification network for starting problem-solution pairs trained over a limited set of real-world examples. Our innovation lies in a novel approach to finding solution-problem pairs, where we only need to predict a rough initial solution, with the corresponding problem generated by an online simulator. Subsequently, homotopy continuation is applied to track that single solution back to the original problem. We apply this elegant combination to generalized camera resectioning, and also introduce a new solution to the challenging generalized relative pose and scale problem. As demonstrated, the proposed method successfully compensates the raw error committed by the regressor alone, and leads to state-of-the-art efficiency and success rates.

Paper Structure

This paper contains 20 sections, 12 equations, 8 figures, 4 tables, 1 algorithm.

Figures (8)

  • Figure 1: Overview of the proposed geometric problem solution scheme. Given input correspondences, a regression network is utilized to approximate a solution. A subsequent online simulator generates a new set of correspondences that is consistent with the regression output. The obtained problem-solution pair is finally used to bootstrap homotopy continuation. The final solution is found efficiently by tracking a single root.
  • Figure 2: Graphical illustration on homotopy continuation(HC) solution curves tracking. For a polynomial system with multiple solutions, each solution curve can be tracked independently as shown in \ref{['sub-fig:HCntrack']}. For each solution curve tracking, HC utilizes a "prediction-correction" scheme to approximate one of the solutions for the target system.
  • Figure 3: The geometry of the generalized camera problems we propose to solve by online simulator HC. $w$ represents the world frame, and $c$ and $c'$ represent camera frames in different views respectively.
  • Figure 4: Experimental results on GRPS. \ref{['fig:numerical_stability_R']} Error distribution over $1000$ trials on noise-free data. The camera number is set to be $3$. Considering the rotation error, except for Gröbner Bases, the other minimal solvers all present a similar error distribution with around $70\%$ success rate, and the eigen solver presents only around $60\%$ success rate. The proposed $8$pts simulator HC presents $96.3\%$ success rate where the Gröbner Bases has $100\%$ success rate. \ref{['fig:time_box']} The boxplot of running time comparison for the proposed simulator HC and other methods, where the number represents the median time. As expected, on average the proposed online simulator HC running on CPU is the fastest. It is about $5\times$ faster than GPU-HC since we only track one solution, $17\times$ faster than Gröbner Bases and about $40\times$ faster than CPU-HC. \ref{['fig:GRPS_noisy']} Error statistics of simulator HC with respect to different noise levels ranging from $0.2$ pixel to $1.0$ pixel.
  • Figure 5: LaMAR dataset multi-camera rig visualization.
  • ...and 3 more figures

Theorems & Definitions (2)

  • Remark : Homotopy Types
  • Remark