Abstract
In this paper, a new method for solving the perspective- n-point (P nP) problem is developed. With an auxiliary point, the linear method for the special case of four coplanar points is extended to find the coarse solutions for the general P3P problem. A recursive least square algorithm with a forgetting factor is introduced to find all the accurate solutions for the P3P problem. Then the algorithm is extended to the general P nP problem. The solution stability issues are investigated for the P3P, P4P and P5P problem, respectively. Furthermore, a pattern is designed to ensure unique solution for the P nP problem. Experiments are performed to verify the effectiveness of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
