Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Compare the efficiency of different solvePnP flags #90

Open
loqoman opened this issue Feb 4, 2020 · 1 comment
Open

Compare the efficiency of different solvePnP flags #90

loqoman opened this issue Feb 4, 2020 · 1 comment
Assignees

Comments

@loqoman
Copy link
Contributor

loqoman commented Feb 4, 2020

We have always used CV_ITERATIVE when using solvePnP, there is a potential for efficiency with other methods of solvePnP organization

From an email by Dana:
CV_ITERATIVE Iterative method is based on Levenberg-Marquardt optimization. In this case the function finds such a pose that minimizes reprojection error, that is the sum of squared distances between the observed projections imagePoints and the projected (using projectPoints() ) objectPoints .

CV_P3P Method is based on the paper of X.S. Gao, X.-R. Hou, J. Tang, H.-F. Chang “Complete Solution Classification for the Perspective-Three-Point Problem”. In this case the function requires exactly four object and image points.

CV_EPNP Method has been introduced by F.Moreno-Noguer, V.Lepetit and P.Fua in the paper “EPnP: Efficient Perspective-n-Point Camera Pose Estimation”.

i think it might be interesting (and relatively quick) to compare the results from each method in quality and speed.

@loqoman
Copy link
Contributor Author

loqoman commented Feb 9, 2020

@JeffreyTT Small write up on this?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants