Globally-Optimal Inlier Set Maximisation for Simultaneous Camera Pose and Feature Correspondence
@article{Campbell2017GloballyOptimalIS, title={Globally-Optimal Inlier Set Maximisation for Simultaneous Camera Pose and Feature Correspondence}, author={Dylan Campbell and Lars Petersson and Laurent Kneip and Hongdong Li}, journal={2017 IEEE International Conference on Computer Vision (ICCV)}, year={2017}, pages={1-10} }
Estimating the 6-DoF pose of a camera from a single image relative to a pre-computed 3D point-set is an important task for many computer vision applications. Perspective-n-Point (PnP) solvers are routinely used for camera pose estimation, provided that a good quality set of 2D-3D feature correspondences are known beforehand. However, finding optimal correspondences between 2D key-points and a 3D point-set is non-trivial, especially when only geometric (position) information is known. Existing…
Figures and Tables from this paper
49 Citations
Globally-Optimal Inlier Set Maximisation for Camera Pose and Correspondence Estimation
- Computer ScienceIEEE Transactions on Pattern Analysis and Machine Intelligence
- 2020
This work proposes a robust and globally-optimal inlier set maximisation approach that jointly estimates the optimal camera pose and correspondences, and outperforms existing approaches on challenging synthetic and real datasets, reliably finding the global optimum.
The Alignment of the Spheres: Globally-Optimal Spherical Mixture Alignment for Camera Pose Estimation
- Computer Science2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
- 2019
This work casts the problem as a 2D-3D mixture model alignment task and proposes the first globally-optimal solution to this formulation under the robust L2 distance between mixture distributions, guaranteeing global optimality without requiring a pose estimate.
Robust and Efficient Estimation of Absolute Camera Pose for Monocular Visual Odometry
- Computer Science2020 IEEE International Conference on Robotics and Automation (ICRA)
- 2020
This work proposes a novel approach based on the robust "L2-minimizing estimate" (L2E) loss that can handle high outlier ratios, leading to high robustness and efficiency, and can run reliably regardless of whether the initial pose is appropriate, providing high generality.
Robust Estimation of Absolute Camera Pose via Intersection Constraint and Flow Consensus
- Computer ScienceIEEE Transactions on Image Processing
- 2020
This paper proposes a general and accurate outlier removal strategy that can be integrated with various existing pose estimation methods originally vulnerable to outliers, and is applicable to points, lines, and the combination of both.
Robust Camera Pose Estimation via Consensus on Ray Bundle and Vector Field
- Computer Science2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- 2018
The proposed outlier removal strategy outperforms state-of-the-art outlier rejection methods in terms of accuracy and robustness and can be integrated into various existing camera pose estimation methods which are originally vulnerable to outliers.
2D-3D Point Set Registration Based on Global Rotation Search
- Computer ScienceIEEE Transactions on Image Processing
- 2019
Compared with existing global optimization approaches, the proposed method utilizes a different problem formulation and more efficiently searches the translation space, which improves the registration speed and significantly outperformed the state-of-the-art local and global methods.
Learning 2D-3D Correspondences To Solve The Blind Perspective-n-Point Problem
- Computer ScienceArXiv
- 2020
A deep CNN model which simultaneously solves for both the 6-DoF absolute camera pose and 2D--3D correspondences and is capable of processing thousands of points a second with the state-of-the-art accuracy.
GO-APSR: A Globally Optimal Affine Point Set Registration Method
- Computer ScienceIEEE Access
- 2019
A deterministic global optimization method for affine point set registration, which works very well in the challenging partially-overlap scenarios and its robustness to noise and outliers is verified.
Multi-person 3D Pose Estimation in Crowded Scenes Based on Multi-View Geometry
- Computer ScienceECCV
- 2020
This paper departs from the multi-person 3D pose estimation formulation, and instead reformulate it as crowd pose estimation, and consists of two key components: a graph model for fast cross-view matching, and a maximum a posteriori (MAP) estimator for the reconstruction of the 3D human poses.
Quasi-Globally Optimal and Efficient Vanishing Point Estimation in Manhattan World
- Computer Science2019 IEEE/CVF International Conference on Computer Vision (ICCV)
- 2019
This work first compute two degrees of freedom of the above rotation by two sampled image lines, and then search for the optimal third DOF based on the branch-and-bound, which accelerates the authors' search by reducing the search space and simplifying the bound computation.
References
SHOWING 1-10 OF 53 REFERENCES
Pose Priors for Simultaneously Solving Alignment and Correspondence
- Computer ScienceECCV
- 2008
This paper models the camera pose space as a Gaussian Mixture Model that is progressively refine by hypothesizing new correspondences, which rapidly reduces the number of potential matches for each 3D point and lets us explore the pose space more thoroughly than SoftPosit at a similar computational cost.
Simultaneous Camera Pose and Correspondence Estimation with Motion Coherence
- Computer ScienceInternational Journal of Computer Vision
- 2011
An algorithm which jointly estimates camera pose and correspondence within a point set registration framework based on motion coherence, with the camera pose helping to localize the edge registration, while the “ambiguous” edge information helps to guide camera pose computation.
SoftPOSIT: Simultaneous Pose and Correspondence Determination
- Computer ScienceInternational Journal of Computer Vision
- 2004
A new algorithm, called SoftPOSIT, for determining the pose of a 3D object from a single 2D image when correspondences between object points and image points are not known, which has an asymptotic run-time complexity that is better than previous methods by a factor of the number of image points.
A novel parametrization of the perspective-three-point problem for a direct computation of absolute camera position and orientation
- Computer ScienceCVPR 2011
- 2011
This paper proposes a novel closed-form solution to the P3P problem, which computes the aligning transformation directly in a single stage, without the intermediate derivation of the points in the camera frame, at much lower computational cost.
Accurate Localization and Pose Estimation for Large 3D Models
- Computer Science2014 IEEE Conference on Computer Vision and Pattern Recognition
- 2014
Experimental results are given demonstrating that it is possible to reliably estimate the camera pose despite more than 99% of outlier correspondences.
SDICP: Semi-Dense Tracking based on Iterative Closest Points
- MathematicsBMVC
- 2015
The goal of the present paper is a novel 2D-3D registration paradigm for semi-dense depth maps that relies on the Iterative Closest Point (ICP) technique, and thus a reintroduction of geometric error minimization as a valid alternative for real-time monocular camera tracking in the case of semi-Dense features.
City-Scale Localization for Cameras with Known Vertical Direction
- Computer ScienceIEEE Transactions on Pattern Analysis and Machine Intelligence
- 2017
This work considers the problem of localizing a novel image in a large 3D model, given that the gravitational vector is known, and extends accurate approximations and fast polynomial solvers to camera pose estimation.
Optimal Relative Pose with Unknown Correspondences
- Computer Science2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- 2016
This paper shows that it is feasible to compute both the epipolar geometry and the correspondences at the same time based on geometry only and demonstrates that more difficult cases can be handled and that more inlier correspondences can be obtained by being less restrictive in the matching phase.
Branch-and-Bound Methods for Euclidean Registration Problems
- Computer Science, MathematicsIEEE Transactions on Pattern Analysis and Machine Intelligence
- 2009
The optimization scheme is based on ideas from global optimization theory, in particular convex underestimators in combination with branch-and-bound methods, and provides a provably optimal algorithm and demonstrates good performance on both synthetic and real data.
Robust and Optimal Sum-of-Squares-Based Point-to-Plane Registration of Image Sets and Structured Scenes
- Computer Science, Mathematics2015 IEEE International Conference on Computer Vision (ICCV)
- 2015
A Sum-of-Squares optimization theory framework is employed for identifying point-to-plane mismatches (i.e. outliers) with certainty and an inliers-maximization approach within a Branch-and-Bound (BnB) search scheme is adopted.