-
Notifications
You must be signed in to change notification settings - Fork 97
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
How do you compute the second nearest distance? #200
Comments
Hi, like this code snippet. In the winning configuration, they didn't use it as quoted under what didn't work in their poster:
I have no idea why they didnt use the closest distance or total distance though:) Did you figure this part out? |
Hi @lunaalvarez, in reality, we wanted to be close to what people did in the original U-Net paper. I think an alternative simple distance calculation was used and worked really well (and was easier/faster) here https://spark-in.me/post/a-small-case-for-search-of-structure-within-your-data. I hope this helps. |
Hi, |
You are welcome, for some reason I was unwatched from this repo for many months and because of that I was silent, sorry @windson87 :( |
Hi, I have some issue understanding your code.
I saw you use the scipy.morphology transform_distance_edt to calculate the nearest distance
but where do you calculate the second nearest one ? since the weights will depending on the second nearest and the first nearest distance, if I understand it correctly.
In the code, the second nearest one is directly taken from the distance matrix dim 1 by calling
Could anyone help me out with this? Thanks in advance
The text was updated successfully, but these errors were encountered: