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

邻居点选择 #42

Closed
jia1047 opened this issue Sep 28, 2024 · 1 comment
Closed

邻居点选择 #42

jia1047 opened this issue Sep 28, 2024 · 1 comment

Comments

@jia1047
Copy link

jia1047 commented Sep 28, 2024

May I ask, based on your paper and open-source code, how to select k neighbor points within a specified radius? If the number of neighbor points within the specified radius does not reach k, what should I do? Or, if I have a problem with my understanding, what should I do

@LiyaoTang
Copy link
Owner

Hi, Jia,

Thanks for your interest. Indeed, I mainly rely on the pre-defined neighborhood search of the network.

That is, if the network (e.g., ConvNet) uses radius-search, I would consider all boundary points within this radius neighbor. Similarly, for k-nn search, I would consider all boundary points in this neighbor of k points.

Best,
Liyao

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