Solving Multilabel Graph Cut Problems with Multilabel Swap
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|
|Source:||Proceedings of the Digital Image Computing: Techniques and Applications (DICTA 2009)|
|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.