Revision as of 08:46, 8 April 2007 edit Bruceporteous (talk \| contribs) 96 edits No edit summary ← Previous edit		Revision as of 08:48, 8 April 2007 edit undo Bruceporteous (talk \| contribs) 96 edits No edit summary Next edit →
Line 8: Although the general k-colour problem remains unsolved for k > 2, the approach of Greig, Porteous and Seheult has turned out to have ~~quite~~ wide applicability in ~~more~~ general computer vision problems. Their approach is often applied iteratively to a sequence of binary images, usually yielding near optimal solutions.

Graph cuts in computer vision: Difference between revisions