A Linear Method for the PnP Problem
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The classical PnP problem (3≤n≤5) is inherently non-linear and generally of multiple solutions and sensitive to errors associated with image points. In the classical PnP problem, only a single image is involved. Inspired by the problems in robot navigation, the PnP problem is extended to the two-image case where the camera undergoes a pure translation between the two images. The obtained main results are: given two images of n known control points captured by a translating camera, (1) When n=3, the camera’s pose and two scaling parameters of the two image axes can be linearly determined; (2) When n≥4, the camera’s pose and all its 5 intrinsic parameters can be linearly determined. In other words, the PnP problem with an uncalibrated camera can be linearly solved in this case. The results presented in this paper appears instructive from both theoretical and practical points of view.

    Reference
    Related
    Cited by
Get Citation

吴福朝,胡占义. PnP问题的线性求解算法.软件学报,2003,14(3):682-688

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 20,2001
  • Revised:June 10,2002
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063