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

About the generation of graphic data #1

Open
fjw525 opened this issue Apr 10, 2021 · 10 comments
Open

About the generation of graphic data #1

fjw525 opened this issue Apr 10, 2021 · 10 comments

Comments

@fjw525
Copy link

fjw525 commented Apr 10, 2021

Hello, can you tell me what method is used to turn the image data into a graphical representation?

@raghavian
Copy link
Owner

Image to graph representation is performed using the method in our earlier work. The pipeline used for that was specific to the internal dataset and is unfortunately not publicly available.

@fjw525
Copy link
Author

fjw525 commented Apr 12, 2021

Thank you for your reply. I have another question. The graph data contains only over-tracked ‘nodes’ and ‘adj’?

@raghavian
Copy link
Owner

Yes. To pose the task as a refinement one, we include low probability airway candidates also. And irrespective of the confidence on the airway node, all nodes are over-connected to the nearest K-neighbours.

@fjw525
Copy link
Author

fjw525 commented Apr 14, 2021

Thank you for your reply. I encountered a problem when I was running the program. An error occurred when adj_flat was generated. Are your adj_dense and adj_target the same shape?And does your ‘nodes’ include x, y, z, radius and 10 directions? Similar to [x,y,z,r,vx,vy,vz.......].
Hope to get your reply

@raghavian
Copy link
Owner

Yes, the node features can be any meaningful attributes and we use the ones described in the paper. For small enough graphs you can work with dense adjacency matrices; however, for large ones you want to exploit their sparsity and it is well supported by sparse operations in Pytorch.

@fjw525
Copy link
Author

fjw525 commented Jun 9, 2021

Thank you for your reply. At present, I am having difficulty finding node features. Can you provide us with the code for generating graphs and node features? Looking forward to your reply

@raghavian
Copy link
Owner

The graph generation was performed on internal data and some of the choices might not translate well. However, as described in the paper it is based on Laplacian of Gaussians at multiple scales or any standard blob detection method. This can be then used to perform the Bayesian smoothing. Please read our manuscript which has all details here.

@fjw525
Copy link
Author

fjw525 commented Jun 20, 2021

Thank you for your reply, I have two other questions. 1. The article mentioned that the mean and variance of each node feature are generated by the ten connected nodes? 2. The ground truth is composed of idx_pos and idx_neg spliced together, will there be situations where the positions do not correspond?
Looking forward to your reply

@raghavian
Copy link
Owner

Hi

  1. The mean and variance are obtained based on the Bayesian smoothing of the tracks as described in this work
  2. By positions, do you mean the spatial location or the index in the adjacency matrix. This operation does not lose any indexing.

@puallee
Copy link

puallee commented May 7, 2022

Did you successfully reproduce the generated graph data?

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

3 participants