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

Questions about init_from_known_poses #102

Open
hturki opened this issue May 6, 2024 · 0 comments
Open

Questions about init_from_known_poses #102

hturki opened this issue May 6, 2024 · 0 comments

Comments

@hturki
Copy link
Contributor

hturki commented May 6, 2024

Thanks for the awesome work! I have a few questions about the init_from_known_poses method at

def init_from_known_poses(self, niter_PnP=10, min_conf_thr=3):

  1. I don't understand the idea behind this statement:
    msk = self.conf_i[i_j] > min(min_conf_thr, self.conf_i[i_j].min() - 0.1)

Everything in self.conf_i[i_j] is larger than self.conf_i[i_j].min() - 0.1, so will this mask not always evaluate to true everywhere?

  1. Also, when calculating these masks, since we are evaluating pred_j (ie: points in the second view in the reference frame of the first, would it not make more sense to use conf_j instead of conf_i?

  2. (More of an comment than a question) The idea behind iterating between all edges, running opencv's pnp, and choosing the best depthmap based on the average confidence score as defined by

    score = float(self.conf_i[i_j].mean())
    seems a bit wasteful. Could one not first find the best pred_j for each image i as determined by average confidence, and then run pnp and get the scaled depthmaps only for those? That would reduce the number of opencv calls to pnp from num_edges to num_images

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

1 participant