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

A question about the paper #9

Open
wzm2256 opened this issue Oct 4, 2020 · 1 comment
Open

A question about the paper #9

wzm2256 opened this issue Oct 4, 2020 · 1 comment

Comments

@wzm2256
Copy link

wzm2256 commented Oct 4, 2020

Hi, thanks for your paper and code!

However, after reading your paper, I'm confusing about the key point matching step:
How can you guarantee that the K key points appeared in both point clouds are the same points? What if they are not coincident? Matching those points may produce large error.
In my opinion, the current algorithm dose not apply to point clouds with smaller overlaps, as mentioned in #3 and #4 . As previous methods, finding the correct matching is always a bottleneck.

@lucasamparo
Copy link

As far I understood the method, they used DGCNN to describe the points and use the descriptor on the L2 norm.

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