Cited by 279Advanced Vision and ImagingRobotics and Sensor-Based Localization3D Surveying and Cultural Heritage

An efficient solution to the five-point relative pose problem

Nister, D.·2003·2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.

Abstract

An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degree polynomial and subsequently finding its roots. It is the first algorithm well suited for numerical implementation that also corresponds to the inherent complexity of the problem. The algorithm is used in a robust hypothesis-and-test framework to estimate structure and motion in real-time.

Integrity signals

Registry

Crossref · 10.1109/cvpr.2003.1211470

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Nister, D.
Venue
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
Published
2003-12-22
Volume
2
Pages
II-195-202
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2142876261
Cited by
279
References
3
Citations by year
2026: 2 · 2025: 3 · 2024: 3 · 2023: 5 · 2022: 7 · 2021: 9 · 2020: 21 · 2019: 6 · 2018: 14 · 2017: 19 · 2016: 9 · 2015: 19 · 2014: 10 · 2013: 19 · 2012: 22
FWCI
11.01
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
  • Physical Sciences › Engineering › Aerospace Engineering › Robotics and Sensor-Based Localization
  • Physical Sciences › Earth and Planetary Sciences › Geology › 3D Surveying and Cultural Heritage
Keywords
corresponding points, polynomial root finding, hypothesis testing, real-time estimation

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