Talk:Graph cuts in computer vision

Untitled

One of my gripes about the article is that it stops right before it gets to one of the best parts of graph cuts: that through constructions like expansion moves (see Boykov, Veskler, Zabih as referenced in the article), you can minimize the energy of a $k>2$-class problem. Iknowyourider (t c) 02:48, 22 June 2007 (UTC)

can someone add a small example?

Can someone give an example of the algorithm working on a small image? a) show how the source, sink and pixels are connected as a graph. b) show how the energy values are computed for one edge. c) show how the system arrives at one cut. —The preceding unsigned comment was added by Hmulling (talk • contribs) 07:20, 25 Jul 2007 (UTC)

Here's some lecture slides that briefly introduce Network flow and Max flow min cut, and then show the reduction of the binary labeling problem to an instance of finding a min cut. The next set of slides have some further details, and a lot of cool example images where the stuff is applied to solve all sorts of problems. The lectures after that [1] [2] introduce $k>2$-class problems. I will try to add a small worked example to this article. Feel free to bug me if I haven't done anything in a few days. Cheers, Iknowyourider (t c) 08:11, 25 July 2007 (UTC)

Needs major rewrites

As someone who is fairly technical, with a moderate background in various levels of multimedia and signal processing, this article does little to further my understanding. Definitely a concrete example would be useful. Also, links to things like Energy Minimization seem misdirected (it is an article on Computation Chemistry). Digging in, I'm thinking maybe the intended target article might be topological optimization, but this is largely a guess. 72.29.167.236 (talk) 19:21, 23 February 2012 (UTC)

Should this article reference segmentation using normalized cuts? 70.166.151.52 (talk) 16:41, 15 February 2017 (UTC)