Graph cuts in computer vision: Difference between revisions

Revision as of 11:50, 8 April 2007

Revision as of 11:51, 8 April 2007

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 wide applicability in general computer vision problems. Their approach is often applied iteratively to a sequence of binary images, usually yielding near optimal solutions. See, for example, the article by Funka-Lea at al, as referenced below, for a recent application.