Skip navigation
Skip navigation

Solving Multilabel Graph Cut Problems with Multilabel Swap

Carr, George Peter; Hartley, Richard


Approximate solutions to labelling problems can be found using binary graph cuts and either the α-expansion or α - β swap algorithms. In some specific cases, an exact solution can be computed by constructing a multilabel graph. However, in many practic

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
Source: Proceedings of the Digital Image Computing: Techniques and Applications (DICTA 2009)
DOI: 10.1109/DICTA.2009.90


File Description SizeFormat Image
01_Carr_Solving_Multilabel_Graph_Cut_2009.pdf1.05 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator