Statement
Image Segmentation
Given an undirected graph
with weights:
- for each
, , and - for each
, . We we find cut that maximises
Solutions
- Image segmentation by max flow
- This runs as fast as your solution to min st-cut
Image Segmentation
Given an undirected graph
with weights:
- for each
, , and - for each
, . We we find cut that maximises