Practical solutions to the relative pose of three calibrated cameras

• URL: http://arxiv.org/abs/2303.16078v4
• Date: Tue, 29 Apr 2025 12:42:40 GMT
• Title: Practical solutions to the relative pose of three calibrated cameras
• Authors: Charalambos Tzamos, Viktor Kocur, Yaqing Ding, Daniel Barath, Zuzana Berger Haladova, Torsten Sattler, Zuzana Kukelova,
• Abstract summary: We study the challenging problem of estimating the relative pose of three calibrated cameras from four point correspondences.<n>We propose novel efficient solutions to this problem that are based on the simple idea of using four correspondences to estimate an approximate geometry of the first two views.
• Score: 59.0302033761239
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the challenging problem of estimating the relative pose of three calibrated cameras from four point correspondences. We propose novel efficient solutions to this problem that are based on the simple idea of using four correspondences to estimate an approximate geometry of the first two views. We model this geometry either as an affine or a fully perspective geometry estimated using one additional approximate correspondence. We generate such an approximate correspondence using a very simple and efficient strategy, where the new point is the mean point of three corresponding input points. The new solvers are efficient and easy to implement, since they are based on existing efficient minimal solvers, i.e., the 4-point affine fundamental matrix, the well-known 5-point relative pose solver, and the P3P solver. Extensive experiments on real data show that the proposed solvers, when properly coupled with local optimization, achieve state-of-the-art results, with the novel solver based on approximate mean-point correspondences being more robust and accurate than the affine-based solver.

Related papers

• A Framework for Reducing the Complexity of Geometric Vision Problems and its Application to Two-View Triangulation with Approximation Bounds [14.419727000332717]
  Triangulation is the task of estimating a 3D point from noisy 2D projections across multiple images. We present a new framework for reducing the computational complexity of geometric vision problems through targeted reweighting of the cost functions used to minimize reprojection errors. Although this work focuses on two-view triangulation, the framework generalizes to other geometric vision problems.
  arXiv  Detail & Related papers  (2025-03-11T08:00:51Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• PoseGravity: Pose Estimation from Points and Lines with Axis Prior [3.5687541347524245]
  This paper presents a new algorithm to estimate absolute camera pose given an axis of the camera's rotation matrix. The problem can be solved efficiently by finding the intersection points of a hyperbola and the unit circle.
  arXiv  Detail & Related papers  (2024-05-21T09:55:56Z)
• Differentiable Registration of Images and LiDAR Point Clouds with VoxelPoint-to-Pixel Matching [58.10418136917358]
  Cross-modality registration between 2D images from cameras and 3D point clouds from LiDARs is a crucial task in computer vision and robotic training. Previous methods estimate 2D-3D correspondences by matching point and pixel patterns learned by neural networks. We learn a structured cross-modality matching solver to represent 3D features via a different latent pixel space.
  arXiv  Detail & Related papers  (2023-12-07T05:46:10Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Quantity-Aware Coarse-to-Fine Correspondence for Image-to-Point Cloud Registration [4.954184310509112]
  Image-to-point cloud registration aims to determine the relative camera pose between an RGB image and a reference point cloud. Matching individual points with pixels can be inherently ambiguous due to modality gaps. We propose a framework to capture quantity-aware correspondences between local point sets and pixel patches.
  arXiv  Detail & Related papers  (2023-07-14T03:55:54Z)
• CheckerPose: Progressive Dense Keypoint Localization for Object Pose Estimation with Graph Neural Network [66.24726878647543]
  Estimating the 6-DoF pose of a rigid object from a single RGB image is a crucial yet challenging task. Recent studies have shown the great potential of dense correspondence-based solutions. We propose a novel pose estimation algorithm named CheckerPose, which improves on three main aspects.
  arXiv  Detail & Related papers  (2023-03-29T17:30:53Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• SASA: Semantics-Augmented Set Abstraction for Point-based 3D Object Detection [78.90102636266276]
  We propose a novel set abstraction method named Semantics-Augmented Set Abstraction (SASA) Based on the estimated point-wise foreground scores, we then propose a semantics-guided point sampling algorithm to help retain more important foreground points during down-sampling. In practice, SASA shows to be effective in identifying valuable points related to foreground objects and improving feature learning for point-based 3D detection.
  arXiv  Detail & Related papers  (2022-01-06T08:54:47Z)
• Robust Extrinsic Symmetry Estimation in 3D Point Clouds [4.416484585765027]
  Detecting the reflection symmetry plane of an object represented by a 3D point cloud is a fundamental problem in 3D computer vision and geometry processing. We propose a statistical estimator-based approach for the plane of reflection symmetry that is robust to outliers and missing parts.
  arXiv  Detail & Related papers  (2021-09-21T03:09:51Z)
• Calibrated and Partially Calibrated Semi-Generalized Homographies [65.29477277713205]
  We propose the first minimal solutions for estimating the semi-generalized homography given a perspective and a generalized camera. The proposed solvers are stable and efficient as demonstrated by a number of synthetic and real-world experiments.
  arXiv  Detail & Related papers  (2021-03-11T08:56:24Z)
• Generalized Pose-and-Scale Estimation using 4-Point Congruence Constraints [5.063728016437489]
  gP4Pc is a new method for computing the absolute pose of a generalized camera with unknown internal scale from four corresponding 3D point-and-ray pairs. Our experiments on real and synthetic datasets, demonstrate that gP4Pc is among the fastest methods in terms of total running time when used within a SACRAN framework.
  arXiv  Detail & Related papers  (2020-11-27T16:30:19Z)
• Solving the Blind Perspective-n-Point Problem End-To-End With Robust Differentiable Geometric Optimization [44.85008070868851]
  Blind Perspective-n-Point is the problem estimating the position of a camera relative to a scene. We propose the first fully end-to-end trainable network for solving the blind geometric problem efficiently globally.
  arXiv  Detail & Related papers  (2020-07-29T06:35:45Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• Learning 2D-3D Correspondences To Solve The Blind Perspective-n-Point Problem [98.92148855291363]
  This paper proposes a deep CNN model which simultaneously solves for both 6-DoF absolute camera pose 2D--3D correspondences. Tests on both real and simulated data have shown that our method substantially outperforms existing approaches.
  arXiv  Detail & Related papers  (2020-03-15T04:17:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.