A robust O(n) solution to the perspective-n-point problem

We propose a noniterative solution for the Perspective-n-Point (PnP) problem, which can robustly retrieve the optimum by solving a seventh order polynomial. The central idea consists of three steps: 1) to divide the reference points into 3-point subsets in order to achieve a series of fourth order p...

全面介紹

Saved in:
書目詳細資料
Main Authors: Li, Shiqi., Xu, Chi., Xie, Ming.
其他作者: School of Mechanical and Aerospace Engineering
格式: Article
語言:English
出版: 2013
主題:
在線閱讀:https://hdl.handle.net/10356/85423
http://hdl.handle.net/10220/13516
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English