Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 295

The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.

Accurate Non-Iterative O(n) Solution to the PnP Problem

Open access
Moreno-Noguer, Francesc, Lepetit, Vincent, Fua, Pascal·2007·2007 IEEE 11th International Conference on Computer Vision

Abstract

We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences—whose computational complexity grows linearly with 𝑛5) or even 𝑂(𝑛8), without being more accurate. Our method is applicable for all 𝑛≥4 and handles properly both planar and non-planar configurations. Our central idea is to express the 𝑛 3D points as a weighted sum of four virtual control points. The problem then reduces to estimating the coordinates of these control points in the camera referential, which can be done in 𝑂(𝑛) time by expressing these coordinates as weighted sum of the eigenvectors of a 12 × 12 matrix and solving a small constant number of quadratic equations to pick the right weights. The advantages of our method are demonstrated by thorough testing on both synthetic and real-data.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iccv.2007.4409116

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 32 references

Cited by

See all 295

Metadata

Authors
Moreno-Noguer, F., Lepetit, V., & Fua, P.
Venue
2007 IEEE 11th International Conference on Computer Vision
Publisher
IEEE
Published
2007
Pages
1-8
OpenAlex
W2036273537
Cited by
295
References
32
FWCI
10.67
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Accurate Non-Iterative O(n) Solution to the PnP Problem. https://app.cochat.ai/papers/10.1109/iccv.2007.4409116
The paper
Moreno-Noguer, F., Lepetit, V., & Fua, P. (2007). Accurate Non-Iterative O(n) Solution to the PnP Problem. 2007 IEEE 11th International Conference on Computer Vision. https://doi.org/10.1109/iccv.2007.4409116

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.