-
-
Notifications
You must be signed in to change notification settings - Fork 949
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
new E decomposition without svd #2920
Conversation
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
Hi! any suggestions about what to return if there is no solution? It can't pass the tests. link |
since we are randomly generating the input, we cannot determine when it'll be able to solve or not... i may say the best case here is to mark the test as xfail -- https://docs.pytest.org/en/stable/how-to/skipping.html#raises-parameter |
Co-authored-by: Edgar Riba <edgar.riba@gmail.com>
for more information, see https://pre-commit.ci
Thanks! let me try it |
for more information, see https://pre-commit.ci
Changes
As SVD used in E decomposition is not stable for training, we would like to intergrate another methodthat recovers the two solutions for the baseline and the orientation from a given essential matrix using elementary matrix operations. This work was done by Berthold K.P. Horn in 1990, and used in Generalized Differentiable RANSAC to build the pose erorr loss.
Fixes # (issue)
Type of change
Checklist