Solving Multilabel Graph Cut Problems with Multilabel Swap
Carr, George Peter; Hartley, Richard
Description
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
| Collections | ANU Research Publications |
|---|---|
| Date published: | 2009 |
| Type: | Conference paper |
| URI: | http://hdl.handle.net/1885/54032 |
| Source: | Proceedings of the Digital Image Computing: Techniques and Applications (DICTA 2009) |
| DOI: | 10.1109/DICTA.2009.90 |
Download
| File | Description | Size | Format | Image |
|---|---|---|---|---|
| 01_Carr_Solving_Multilabel_Graph_Cut_2009.pdf | 1.05 MB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 20 July 2017/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator
+61 2 6125 5111
The Australian National University, Canberra
CRICOS Provider : 00120C
ABN : 52 234 063 906
