Main > Acta Optica Sinica >  Volume 29 >  Issue 1 >  Page 6 > Article
  • Abstract
  • Abstract
  • View Summary
  • Figures (0)
  • Tables (0)
  • Equations (0)
  • References (15)
  • Get PDF(in Chinese)
  • Paper Information
  • Received: Sep. 17, 2008

    Accepted: --

    Posted: Jan. 1, 2009

    Published Online: Jun. 19, 2020

    The Author Email: Yunxi Xu (

    DOI: 10.3788/aos20092901.0072

  • Get Citation
  • Copy Citation Text

    Xu Yunxi, Jiang Yunliang, Chen Fang. Generalized Orthogonal Iterative Algorithm for Pose Estimation of Multiple Camera Systems[J]. Acta Optica Sinica, 2009, 29(1): 6

    Download Citation

  • Category
  • Fiber Optics and Optical Communications
  • Share
Acta Optica Sinica, Vol. 29, Issue 1, 6 (2009)

Generalized Orthogonal Iterative Algorithm for Pose Estimation of Multiple Camera Systems

Yunxi Xu1,*, Yunliang Jiang1,2, and Fang Chen3

Author Affiliations

  • 1[in Chinese]
  • 2[in Chinese]
  • 3[in Chinese]


It still lacks of systematic method for solving pose estimation of a multiple camera system (MCS). The pose-estimation problem is usually achieved by solving the Perspective-n-point problem or finding the least-squared-error rigid transformation between two 3D point sets. They have limitations. The orthogonal iteration (OI) algorithm is charalteristic can converge fast and globally is based on points. And it is one of the state-of-art real-time pose estimation algorithms and used widely. A generalized iterative algorithm is proposed. It is a universal multi-view algorithm for pose estimation. In the method, all images acquired from the cameras are treated as a whole, and the relative pose parameter is calculated this method, datum of multiple cameras is unified, and the sum of object-space collinearity error of feature points all cameras sensed is used as error function for MCS. An iterative algorithm is developed to minimize the error function. The experiment result demonstrates its effectiveness and superiority of the algorithm for pose estimation of MCS.


Please Enter Your Email: