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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An efficient solution to the five-point relative pose problem


    Contributors:
    Nister, D. (author)


    Publication date :

    2003-01-01


    Size :

    675922 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Efficient Solution to the Five-Point Relative Pose Problem

    Nister, D. / IEEE | British Library Conference Proceedings | 2003


    An efficient solution to the perspective-three-point pose problem

    Wang, Ping / Xu, Guili / Wang, Zhengsheng et al. | British Library Online Contents | 2018



    A Minimal Solution to the Generalised 3-Point Pose Problem

    Nister, D. / IEEE Computer Society | British Library Conference Proceedings | 2004


    A Minimal Solution to the Generalised 3-Point Pose Problem

    Nistér, D. / Stewénius, H. | British Library Online Contents | 2007