PaperICCV · 2001
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images
2pages built on it
1more page cites it
1narrative
2registry papers cite it
In the Atlas
ConceptPrimary source of
Energy Minimization
The framework that poses image labelling and segmentation as minimising an objective combining a per-pixel data term and a pairwise smoothness term over a graph of pixels.
AlgorithmPrimary source of
Graph-Cut Interactive Segmentation
Compute the global minimum of a binary region-and-boundary MRF energy as a single s-t min-cut on a pixel graph; user-marked seeds enter as hard constraints, the output is a binary labelling.
Cited as a reference by 1 page, grouped by domain
Segmentation 1
Appears in 1 narrative
Lineage
Papers in the Atlas registry only · one dot per paperBuilt upon by · 2