Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
- URL: http://arxiv.org/abs/2606.09477v1
- Date: Mon, 08 Jun 2026 13:36:27 GMT
- Title: Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
- Abstract summary: Estimating the relative poses of multi-camera systems is a fundamental problem in computer vision.<n>We propose two efficient minimal solvers for estimating the relative poses of multi-camera systems using a novel parameterization.
- Score: 11.678515238325817
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Estimating the relative poses of multi-camera systems is a fundamental problem in computer vision, with critical applications in autonomous vehicles, mobile devices, and unmanned aerial vehicles (UAVs). However, existing solutions often suffer from high computational complexity or rely on an excessive number of point correspondences, limiting their real-world applicability. To address these limitations, we propose two efficient minimal solvers for estimating the relative poses of multi-camera systems using a novel parameterization. The first solver leverages the vertical direction prior provided by Inertial Measurement Units (IMUs), while the second utilizes the rotation axis direction prior from IMUs. Our methods require only four point correspondences and reduce the problem of multi-camera relative pose estimation to solving a univariate 6th-degree polynomial, a significant improvement over existing approaches, which typically involve 8th-degree polynomials. This reduction in computational complexity and correspondence requirements makes our solvers particularly effective when integrated into RANSAC frameworks, demonstrating strong potential for visual odometry applications. Through rigorous evaluations on synthetic data and the KITTI benchmark, our methods achieved superior computational efficiency and competitive accuracy compared to state-of-the-art algorithms.
Related papers
- Gravity-aware partially calibrated absolute pose estimation from affine- or rotation-covariant features [8.4929502957148]
Inertial measurement units (IMUs) are now standard in most consumer devices, such as smartphones, drones, and extended reality (XR) headsets.<n>By fusing visual and inertial data, localization systems gain significantly in speed and robustness compared to vision-only or IMU-only approaches.<n>Traditional pose estimation methods fail to utilize the local geometric information embedded in feature descriptors like SIFT.<n>Recent work has proved the advantages of leveraging this information for relative and absolute pose estimation, but its application to partially calibrated absolute pose estimation remains unexplored.
arXiv Detail & Related papers (2026-08-20T13:52:54Z) - COMPOSE: Hypergraph Cover Optimization for Multi-view 3D Human Pose Estimation [58.47973015036709]
3D pose estimation from sparse multi-views is a critical task for action recognition, sports analysis, and human-robot interaction.<n>We propose COMPOSE, a novel framework that formulates multi-view pose correspondence matching as a hypergraph problem.<n> COMPOSE achieves improvements of up to 23% in average precision over previous optimization-based methods and up to 11% over self-supervised end-to-end learned methods.
arXiv Detail & Related papers (2026-01-14T18:50:17Z) - PowerYOLO: Mixed Precision Model for Hardware Efficient Object Detection with Event Data [0.5461938536945721]
PowerYOLO is a mixed precision solution to the problem of fitting algorithms of high memory and computational complexity into small low-power devices.
First, we propose a system based on a Dynamic Vision Sensor (DVS), a novel sensor, that offers low power requirements.
Second, to ensure high accuracy and low memory and computational complexity, we propose to use 4-bit width Powers-of-Two (PoT) quantisation.
Third, we replace multiplication with bit-shifting to increase the efficiency of hardware acceleration of such solution.
arXiv Detail & Related papers (2024-07-11T08:17:35Z) - Affine Correspondences between Multi-Camera Systems for Relative Pose
Estimation [11.282703971318934]
We present a novel method to compute the relative pose of multi-camera systems using two affine correspondences (ACs)
This paper shows that the 6DOF relative pose estimation problem using ACs permits a feasible minimal solution.
Experiments on both virtual and real multi-camera systems prove that the proposed solvers are more efficient than the state-of-the-art algorithms.
arXiv Detail & Related papers (2023-06-22T15:52:48Z) - Accelerating Globally Optimal Consensus Maximization in Geometric Vision [28.72335941963025]
We present a novel, general technique that allows us to branch over an n-1 dimensional space for an n-dimensional problem.
The remaining degree of freedom can be solved globally optimally within each bound calculation.
We present applications to four fundamental geometric computer vision problems.
arXiv Detail & Related papers (2023-04-11T11:47:34Z) - Practical solutions to the relative pose of three calibrated cameras [61.7981056628391]
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.
arXiv Detail & Related papers (2023-03-28T15:50:48Z) - Sparse resultant based minimal solvers in computer vision and their
connection with the action matrix [17.31412310131552]
We show that for some camera geometry problems our extra-based method leads to smaller and more stable solvers than the state-of-the-art Grobner basis-based solvers.
It provides a competitive alternative to popularner basis-based methods for minimal problems in computer vision.
arXiv Detail & Related papers (2023-01-16T14:25:19Z) - Multi-Resource Allocation for On-Device Distributed Federated Learning
Systems [79.02994855744848]
This work poses a distributed multi-resource allocation scheme for minimizing the weighted sum of latency and energy consumption in the on-device distributed federated learning (FL) system.
Each mobile device in the system engages the model training process within the specified area and allocates its computation and communication resources for deriving and uploading parameters, respectively.
arXiv Detail & Related papers (2022-11-01T14:16:05Z) - 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) - Reconfigurable Intelligent Surface Assisted Mobile Edge Computing with
Heterogeneous Learning Tasks [53.1636151439562]
Mobile edge computing (MEC) provides a natural platform for AI applications.
We present an infrastructure to perform machine learning tasks at an MEC with the assistance of a reconfigurable intelligent surface (RIS)
Specifically, we minimize the learning error of all participating users by jointly optimizing transmit power of mobile users, beamforming vectors of the base station, and the phase-shift matrix of the RIS.
arXiv Detail & Related papers (2020-12-25T07:08:50Z) - Fully Quantized Image Super-Resolution Networks [81.75002888152159]
We propose a Fully Quantized image Super-Resolution framework (FQSR) to jointly optimize efficiency and accuracy.
We apply our quantization scheme on multiple mainstream super-resolution architectures, including SRResNet, SRGAN and EDSR.
Our FQSR using low bits quantization can achieve on par performance compared with the full-precision counterparts on five benchmark datasets.
arXiv Detail & Related papers (2020-11-29T03:53:49Z) - Computing stable resultant-based minimal solvers by hiding a variable [20.402488757146692]
Computer vision applications require robust estimation of camera geometry from a minimal number of input data measurements.
In this paper, we study an interesting alternative sparse-based method for solving sparse systems of equations by hiding one variable.
We show that for the studied problems, our resultant based approach leads to more stable solvers than the state-of-the-art Gr"obner bases-based solvers.
arXiv Detail & Related papers (2020-07-17T07:40:10Z)
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.