Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/85423
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, Shiqi.en
dc.contributor.authorXu, Chi.en
dc.contributor.authorXie, Ming.en
dc.date.accessioned2013-09-18T03:18:43Zen
dc.date.accessioned2019-12-06T16:03:30Z-
dc.date.available2013-09-18T03:18:43Zen
dc.date.available2019-12-06T16:03:30Z-
dc.date.copyright2012en
dc.date.issued2012en
dc.identifier.citationLi, S., Xu, C., & Xie, M. (2012). A robust O(n) solution to the perspective-n-point problem. IEEE transactions on pattern analysis and machine intelligence, 34(7), 1444-1450.en
dc.identifier.issn0162-8828en
dc.identifier.urihttps://hdl.handle.net/10356/85423-
dc.description.abstractWe 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 polynomials, 2) to compute the sum of the square of the polynomials so as to form a cost function, and 3) to find the roots of the derivative of the cost function in order to determine the optimum. The advantages of the proposed method are as follows: First, it can stably deal with the planar case, ordinary 3D case, and quasi-singular case, and it is as accurate as the state-of-the-art iterative algorithms with much less computational time. Second, it is the first noniterative PnP solution that can achieve more accurate results than the iterative algorithms when no redundant reference points can be used (n≤ 5). Third, large-size point sets can be handled efficiently because its computational complexity is O(n).en
dc.language.isoenen
dc.relation.ispartofseriesIEEE transactions on pattern analysis and machine intelligenceen
dc.rights© 2012 IEEEen
dc.subjectDRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognitionen
dc.titleA robust O(n) solution to the perspective-n-point problemen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen
dc.identifier.doi10.1109/TPAMI.2012.41en
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:MAE Journal Articles

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.