Skip to content
AI News HubLIVE
Original source2 min read

PnP*: A certifiable solver for Perspective-n-Point

Summary

The paper introduces PnP*, the first practical certifiable solver for the maximum likelihood estimation of Perspective-n-Point. It provides a stability guarantee for its convex relaxation under moderate noise and leverages chordal sparsity and quotient ring reduction to achieve scalability, returning provably optimal camera poses at over 10 Hz.

SourcearXiv Computer VisionAuthor: Bang-Shien Chen, Caitrin E. Eaton, David M. Rosen
PnP*: A certifiable solver for Perspective-n-Point
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 22 Oct 2026]

Title:PnP*: A certifiable solver for Perspective-n-Point

View a PDF of the paper titled PnP*: A certifiable solver for Perspective-n-Point, by Bang-Shien Chen and 2 other authors

View PDF HTML (experimental)

Abstract:Estimating a camera pose from 3D-2D correspondences - Perspective-n-Point - is one of the most fundamental problems in computer vision. Existing methods either solve a minimal problem or replace the objective with an easier one. Surprisingly, no scalable certifiable solver for the actual Maximum Likelihood Estimation (MLE) exists. We propose PnP*, the first practical solver that guarantees efficient computation and returns a certifiable globally optimal solution. We prove that the underlying convex relaxation is exact under moderate noise, which to our knowledge is the first stability guarantee for any relaxation for the MLE of PnP. Furthermore, we reduce the relaxation by exploiting chordal sparsity pattern and quotient ring reduction such that the relaxation is tractable and scalable. The stability and scalability results are verified numerically, as PnP* returns a provably correct camera pose at over 10 Hz.

Comments: 28 pages, 3 figures

Subjects:

Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO); Optimization and Control (math.OC)

Cite as: arXiv:2610.31797 [cs.CV]

(or arXiv:2610.31797v1 [cs.CV] for this version)

https://doi.org/10.48550/arXiv.2610.31797

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Bang-Shien Chen [view email] [v1] Thu, 22 Oct 2026 18:38:48 UTC (248 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled PnP*: A certifiable solver for Perspective-n-Point, by Bang-Shien Chen and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.CV

new | recent | 2026-10

Change to browse by:

cs cs.RO math math.OC

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • PnP* is the first scalable certifiable solver for the MLE of PnP.
  • The authors prove that the convex relaxation is exact under moderate noise, providing the first stability guarantee for any relaxation for PnP MLE.
  • Chordal sparsity and quotient ring reduction make the relaxation tractable and scalable.
  • Numerical results confirm stability and scalability, returning provably correct camera poses at over 10 Hz.

Highlights and analysis are generated automatically and may contain errors. Check the original source.