Acta Optica Sinica, Volume. 38, Issue 11, 1115006(2018)

Solving Perspective-n-Point Problem in Variable Projection Framework Based on Wahba Problem

Ying He*, Rong Ma, Suilao Li, and Qiang Guo
Author Affiliations
  • School of Automation, Northwestern Polytechnical University, Xi'an, Shaanxi 710129, China
  • show less

    We propose an algorithm that solves the perspective-n-point problem in the framework of variable projection. The perspective-n-point is the problem of determining the rotation and translation parameters of a camera, which is widely used in computer vision, photogrammetry, robotics, space rendezvous and virtual reality. We separately estimate the rotation and translation parameters in the variable projection framework. Firstly, an optimal rotation matrix is solved by using the Wahba problem with fixed translation parameters. By applying the formula for the derivative of the singular value decomposition, the derivative of the optimal rotation matrix is calculated with respect to the translation parameters, then the derivative of the objective function with respect to the translation parameters is obtained. Finally, the objective function is minimized by Levenberg-Marquardt algorithm over the translation parameters. The experimental results show that the proposed algorithm is one of the most accurate and effective algorithms and has a large convergence basin.

    Tools

    Get Citation

    Copy Citation Text

    Ying He, Rong Ma, Suilao Li, Qiang Guo. Solving Perspective-n-Point Problem in Variable Projection Framework Based on Wahba Problem[J]. Acta Optica Sinica, 2018, 38(11): 1115006

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Machine Vision

    Received: May. 8, 2018

    Accepted: Jul. 12, 2018

    Published Online: May. 9, 2019

    The Author Email:

    DOI:10.3788/AOS201838.1115006

    Topics