Relative pose of three calibrated and partially calibrated cameras from four points using virtual correspondences

• URL: http://arxiv.org/abs/2303.16078v2
• Date: Mon, 11 Dec 2023 15:13:24 GMT
• Title: Relative pose of three calibrated and partially calibrated cameras from four points using virtual correspondences
• Authors: Charalambos Tzamos, Daniel Barath, Torsten Sattler, Zuzana Kukelova
• Abstract summary: We study challenging problems of estimating the relative pose of three cameras. Our solutions are based on the simple idea of generating one or two additional virtual point correspondences in two views. Our solvers achieve state-of-the-art results on real data.
• Score: 68.46101050286173
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study challenging problems of estimating the relative pose of three cameras and propose novel efficient solutions to (1) the notoriously difficult configuration of four points in three calibrated views, known as the 4p3v problem, and (2) to the previously unsolved configuration of four points in three cameras with unknown shared focal length, i.e., the 4p3vf problem. Our solutions are based on the simple idea of generating one or two additional virtual point correspondences in two views by using the information from the locations of the four input correspondences in the three views. We generate such correspondences using either a very simple and efficient strategy where the new points are the mean points of three corresponding input points or using a simple neural network. The new solvers are efficient and easy to implement since they are based on existing efficient minimal solvers, i.e., the well-known 5-point and 6-point relative pose solvers and the P3P solver. Our solvers achieve state-of-the-art results on real data.

Related papers

• 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)
• 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)
• 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)
• Learning to Solve Hard Minimal Problems [6.117371161379209]
  We present an approach to solving hard geometric optimization problems in the RANSAC framework. The hard minimal problems arise from relaxing the original geometric optimization problem into a minimal problem with many spurious solutions.
  arXiv  Detail & Related papers  (2021-12-06T23:51:20Z)
• 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)
• 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.