how to build a graph from a skeleton

Question

Dibanda Annick 2019-5-17

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/462652-how-to-build-a-graph-from-a-skeleton

回答： George Abrahams 2024-1-2

i got a 2D skeleton from a binary vessel map after applying thinning. Now i would like to build an undirected graph from this skeleton with nodes and edges linked together.

2 个评论
显示无隐藏无

Abir AFFANE 2020-5-10

Try this

https://fr.mathworks.com/matlabcentral/fileexchange/43527-skel2graph-3d

Kamya H 2021-7-7

Hey! I'm facing the same problem! Did you manage to find any answers/code to this question? tried skel2graph-3d too, but I'm getting quite a lot of errors!

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Mike Wharton 2023-10-18

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/462652-how-to-build-a-graph-from-a-skeleton#answer_1335814

编辑：Mike Wharton 2023-10-18

在 MATLAB Online 中打开

Try using this toolbox from Steve Eddins https://www.mathworks.com/matlabcentral/fileexchange/53614-image-graphs

There is a blog post which explains what to do https://blogs.mathworks.com/steve/2015/12/14/image-based-graphs/

I think it is essentially something like this:

g = binaryImageGraph(bw);
figure
plotImageGraph(g)

This should work with a skeletonised binary image.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

Answer 2

George Abrahams 2024-1-2

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/462652-how-to-build-a-graph-from-a-skeleton#answer_1381886

在 MATLAB Online 中打开

binaryVesselMap.png

Another method, using my bwgraph function from File Exchange.

% Load binary vessel map and skeletonize.
img = imread( "binaryVesselMap.png" );
img = bwskel( img );
% Construct an undirected graph from the skeletonized image.
G = bwgraph( img );
% For visual clarity and to save RAM, delete isolated nodes (those with no 
% edges).
G = rmnode( G, find( ~img ) );
% Plot the graph, mimicking the layout of the source image.
[ Y, X ] = ind2sub( size( img ), find( img ) );
h = plot( G, 'XData', X(:), 'YData', Y(:), 'NodeLabel', [] );
axis tight equal
set( gca, 'YDir','reverse' )
% As an example application, use graph algorithms to find and highlight the 
% longest branch of the graph. Distances are quasi-Euclidean.
d = distances( G );
d( isinf( d ) ) = -Inf;
[ ~, I ] = max( d(:) );
[ row, col ] = ind2sub( size( d ), I );
P = shortestpath( G, row, col );
highlight( h, P, 'NodeColor', 'r' )