| Segmentation by min (s-t)
cut [Boykov 2001] |
| min cut |
| s |
| t |
|
|
|
|
|
|
|
|
|
|
|
|
|
| Graph |
||||||||||||
| • | node for each
pixel, link between pixels |
|||||||||||
| • | specify a few
pixels as foreground and background |
|||||||||||
| – | create an
infinite cost link from each bg pixel to the “t” node |
|||||||||||
| – | create an
infinite cost link from each fg pixel to the “s” node |
|||||||||||
| • | compute min cut
that separates s from t |
|||||||||||
| • | how to define
link cost between neighboring pixels? |
|||||||||||