Solving Multilabel Graph Cut Problems with Multilabel Swap
Date
Authors
Carr, George Peter
Hartley, Richard
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE Inc)
Abstract
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
Description
Citation
Collections
Source
Proceedings of the Digital Image Computing: Techniques and Applications (DICTA 2009)
Type
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description