P3P Made Easy

• URL: http://arxiv.org/abs/2508.01312v1
• Date: Sat, 02 Aug 2025 10:58:03 GMT
• Title: P3P Made Easy
• Abstract summary: We present a novel solution to the Perspective-Three-Point (P3P) problem.<n>Our method reformulates the problem into a quartic with coefficients that are analytically simple and computationally efficient.
• Score: 14.46196444719236
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a novel algebraic solution to the Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. Our method reformulates the problem into a quartic polynomial with coefficients that are analytically simple and computationally efficient. Despite its simplicity, the proposed solver achieves accuracy and runtime performance comparable to state-of-the-art methods. Extensive experiments on synthetic datasets validate its robustness and efficiency. This combination of simplicity and performance makes our solver appealing for both real-time systems and educational contexts, where interpretability and reliability are critical.

Related papers

• Fast and Compact 3D Gaussian Splatting with Polarized Opacity Prior [33.143169558717105]
  3D Gaussian Splatting (3DGS) achieves state-of-the-art rendering quality at real-time speeds but suffers from "model bloat"<n>This inefficiency stems from the standard "densify-then-prune" paradigm.<n>We present an efficient training framework that builds an intrinsically compact representation.
  arXiv  Detail & Related papers  (2026-08-23T10:21:30Z)
• REFINE: Super-efficient 3D Gaussian Splatting Pruning via Rendering-Free Primitive Importance [58.94345609736356]
  REFINE is a highly accelerated 3DGS pruning framework centered on a novel rendering-free primitive importance metric.<n>Experiments across multiple benchmark datasets demonstrate that REFINE maintains highly competitive rendering quality.
  arXiv  Detail & Related papers  (2026-06-08T06:16:38Z)
• GaussianPOP: Principled Simplification Framework for Compact 3D Gaussian Splatting via Error Quantification [5.355982355439107]
  GaussianPOP is a principled simplification framework based on analytical Gaussian error quantification.<n>By introducing a highly efficient algorithm, our framework enables practical error calculation in a single forward pass.<n>We show that our method consistently outperforms existing state-of-the-art pruning methods across both application scenarios.
  arXiv  Detail & Related papers  (2026-02-06T16:17:41Z)
• Tail-Aware Post-Training Quantization for 3D Geometry Models [58.79500829118265]
  Post-Training Quantization (PTQ) enables efficient inference without retraining.<n>PTQ fails to transfer effectively to 3D models due to intricate feature distributions and prohibitive calibration overhead.<n>We propose TAPTQ, a Tail-Aware Post-Training Quantization pipeline for 3D geometric learning.
  arXiv  Detail & Related papers  (2026-02-02T07:21:15Z)
• A Conic Transformation Approach for Solving the Perspective-Three-Point Problem [9.832854851136535]
  We propose a conic transformation method to solve the Perspective-Three-Point (P3P) problem.<n>Our approach builds upon a new formulation based on a transformation that maps the two conics to a new coordinate system.<n>Our method achieves higher speed while maintaining robustness and stability comparable to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-04-02T11:27:47Z)
• Autoformulation of Mathematical Optimization Models Using LLMs [50.030647274271516]
  This paper approaches the problem of $textitautoformulation$: the automated creation of solver-ready optimization models from natural language problem descriptions.<n>We identify three core challenges of autoformulation: $textit(1)$ the vast, problem-dependent hypothesis space, and $textit(2)$ efficient and diverse exploration of this space under uncertainty.<n>We present a novel method leveraging $textitLarge Language Models$ with $textitMonte-Carlo Tree Search$, exploiting the hierarchical nature of optimization modeling to generate and systematically explore possible formulations
  arXiv  Detail & Related papers  (2024-11-03T20:41:38Z)
• PF3plat: Pose-Free Feed-Forward 3D Gaussian Splatting [54.7468067660037]
  PF3plat sets a new state-of-the-art across all benchmarks, supported by comprehensive ablation studies validating our design choices.<n>Our framework capitalizes on fast speed, scalability, and high-quality 3D reconstruction and view synthesis capabilities of 3DGS.
  arXiv  Detail & Related papers  (2024-10-29T15:28:15Z)
• DynaWeightPnP: Toward global real-time 3D-2D solver in PnP without correspondences [7.191124861153032]
  This paper addresses a special Perspective-n-Point (Weight) problem: estimating the optimal pose to align 3D and 2D shapes in real-time without correspondences. Experiments were conducted on a typical case, that is, a 3D-2D centerline registration task within Endovascular Image-Guided Interventions. Results demonstrated that the proposed algorithm achieves registration processing rates of 60 Hz (without post-refinement) and 31 (with post-refinement) with competitive accuracy comparable to existing methods.
  arXiv  Detail & Related papers  (2024-09-27T05:31:33Z)
• Efficient Fairness-Performance Pareto Front Computation [51.558848491038916]
  We show that optimal fair representations possess several useful structural properties. We then show that these approxing problems can be solved efficiently via concave programming methods.
  arXiv  Detail & Related papers  (2024-09-26T08:46:48Z)
• Rational-WENO: A lightweight, physically-consistent three-point weighted essentially non-oscillatory scheme [14.120671138290104]
  We employ a rational neural network to accurately estimate the local smoothness of the solution. This approach achieves a granular reconstruction with significantly reduced dissipation. We demonstrate the effectiveness of our approach on several one-, two-, and three-dimensional fluid flow problems.
  arXiv  Detail & Related papers  (2024-09-13T22:11:03Z)
• Learning Unnormalized Statistical Models via Compositional Optimization [73.30514599338407]
  Noise-contrastive estimation(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise. In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models.
  arXiv  Detail & Related papers  (2023-06-13T01:18:16Z)
• A Deep Unrolling Model with Hybrid Optimization Structure for Hyperspectral Image Deconvolution [50.13564338607482]
  We propose a novel optimization framework for the hyperspectral deconvolution problem, called DeepMix.<n>It consists of three distinct modules, namely, a data consistency module, a module that enforces the effect of the handcrafted regularizers, and a denoising module.<n>This work proposes a context aware denoising module designed to sustain the advancements achieved by the cooperative efforts of the other modules.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Efficient and Deterministic Search Strategy Based on Residual Projections for Point Cloud Registration with Correspondences [18.509532571594995]
  Current 3D feature matching approaches commonly lead to numerous outlier correspondences, making outlier-robust registration techniques indispensable. We introduce a novel pose decoupling strategy based on residual projections, decomposing the raw registration problem into three sub-problems. Our method can be adapted to address the challenging problem of simultaneous pose and registration.
  arXiv  Detail & Related papers  (2023-05-19T14:52:40Z)
• Practical solutions to the relative pose of three calibrated cameras [59.0302033761239]
  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)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques [2.239917051803691]
  The authors present a lightweight solution for the complex problem of 3D protein structure search. The solution consists of three steps -- (i) transformation of 3D protein structural information into very compact vectors, (ii) use of a probabilistic model to group these vectors and respond to queries by returning a given number of similar objects, and (iii) a final filtering step which applies basic vector distance functions to refine the result.
  arXiv  Detail & Related papers  (2022-08-18T15:22:42Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• A Model for Multi-View Residual Covariances based on Perspective Deformation [88.21738020902411]
  We derive a model for the covariance of the visual residuals in multi-view SfM, odometry and SLAM setups. We validate our model with synthetic and real data and integrate it into photometric and feature-based Bundle Adjustment.
  arXiv  Detail & Related papers  (2022-02-01T21:21:56Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• Stable Implementation of Probabilistic ODE Solvers [27.70274403550477]
  Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty. They suffer from numerical instability when run at high order or with small step-sizes. The present work proposes and examines a solution to this problem. It involves three components: accurate initialisation, a coordinate change preconditioner that makes numerical stability concerns step-size-independent, and square-root implementation.
  arXiv  Detail & Related papers  (2020-12-18T08:35:36Z)
• Automated and Sound Synthesis of Lyapunov Functions with SMT Solvers [70.70479436076238]
  We synthesise Lyapunov functions for linear, non-linear (polynomial) and parametric models. We exploit an inductive framework to synthesise Lyapunov functions, starting from parametric templates.
  arXiv  Detail & Related papers  (2020-07-21T14:45:23Z)
• Learning 3D-3D Correspondences for One-shot Partial-to-partial Registration [66.41922513553367]
  We show that learning-based partial-to-partial registration can be achieved in a one-shot manner. We propose an Optimal Transport layer able to account for occluded points thanks to the use of bins. The resulting OPRNet framework outperforms the state of the art on standard benchmarks.
  arXiv  Detail & Related papers  (2020-06-08T12:35:47Z)

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.