Revision as of 01:51, 2 November 2019 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits →Energy function ← Previous edit		Revision as of 08:22, 9 November 2019 edit undo Tino (talk \| contribs) 456 edits →Algorithm: See also main article on algorithm Next edit →
Line 72: == Algorithm == {{see also\|Graph cut optimization}} * Minimization is done using a standard minimum cut algorithm. * Due to the [[Max-flow min-cut theorem]] we can solve energy minimization by maximizing the flow over the network. The Max Flow problem consists of a directed graph with edges labeled with capacities, and there are two distinct nodes: the source and the sink. Intuitively, it's easy to see that the maximum flow is determined by the bottleneck.

Graph cuts in computer vision: Difference between revisions