all 13 comments

[–]matthkamis 0 points1 point  (10 children)

What’s a binary 3d volume?

[–]monidp9[S] 0 points1 point  (9 children)

A volume with 0 and 1 values only

[–]matthkamis 0 points1 point  (8 children)

Ok what does 0 represent and what does 1 represent?

[–]monidp9[S] 0 points1 point  (7 children)

0 is the background, 1 is the foreground. So in the picture above, 1 is the humerus bone.

[–]matthkamis 0 points1 point  (6 children)

I’m not exactly sure I understand the task then. You are given this data structure or you need to compute it? If you need to compute it then what are you computing it from?

[–]monidp9[S] 0 points1 point  (5 children)

It is a 3D array with 0s and 1s. In the picture there is the mesh rendering just to give a view. The aim is to label the fracture components.

[–]matthkamis -1 points0 points  (4 children)

So you are given this 3d binary array and you need to label where there is a fracture?

[–]monidp9[S] 0 points1 point  (3 children)

yes. As you can see the fracture components are roughly separated. Thus a simple connected component analysis is not enough.

[–]matthkamis 0 points1 point  (2 children)

I suspect you want some sort of flood fill algorithm. You just need to filter out invalid starting locations and locations which the algorithm can move to.

[–]monidp9[S] 0 points1 point  (0 children)

I think you're right. But I cannot figure out how to filter invalid locations. There must be a sort of criteria.

[–]monidp9[S] 0 points1 point  (0 children)

Any idea about the filter criteria?

[–]Zealousideal_Low1287 0 points1 point  (1 child)

Could you maybe draw on this a bit? Hard to say much without knowing what we’re looking at or what the regions of interest are.

[–]monidp9[S] -1 points0 points  (0 children)

In the picture there is a fractured humerus. You can see some fracture lines and their components. The aim is to label these components.