Revision as of 08:38, 8 April 2007 edit Bruceporteous (talk \| contribs) 96 edits No edit summary ← Previous edit		Revision as of 08:39, 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 is now very commonly used in general computer vision problems, often by applying their approach iteratively to a sequence of binary images. ~~This~~and this approach often yields near optimal solutions.

Graph cuts in computer vision: Difference between revisions