Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N–D images - Githubissues

csorbakristof / GrainRW

Related work - literature sweep for GrainAutLine

0 stars 0 forks source link

Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N–D images #56

Closed csorbakristof closed 4 years ago

csorbakristof commented 9 years ago

Level sets, MRF and graph-cut based segmentation