Graph Algorithms Shortest path problems. Graph Algorithms Shortest path problems.
Live-Wire Segmentation with "shortest path" By Ilan Smoly.
15
Live-Wire Segmentation with "shortest path" By Ilan Smoly
-
Upload
lenard-bradford -
Category
Documents
-
view
226 -
download
4
Transcript of Live-Wire Segmentation with "shortest path" By Ilan Smoly.
Approaches with graphs
• Intelligent scissors and Live wire - Optimal path (Dijkstra)
• Binary images posteriori estimation – Min-cut/Max-flow• Seeds – Min-cut/Max-flow with user inputs.
Discussion
• powerful and efficient tool for image editing and analyzing.
• Medical use• Not reliable for long distance pathways