A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization
Abstract
The incorporation of region regularization into max-flow segmentation has traditionally focused on ordering and part-whole relationships. A side effect of the development of such models is that it constrained regularization only to those cases, rather than allowing for arbitrary region regularization. Directed Acyclic Graphical Max-Flow (DAGMF) segmentation overcomes these limitations by allowing for the algorithm designer to specify an arbitrary directed acyclic graph to structure a max-flow segmentation. This allows for individual 'parts' to be a member of multiple distinct 'wholes.'
Keywords
Cite
@article{arxiv.1405.0892,
title = {A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization},
author = {John S. H. Baxter and Martin Rajchl and Jing Yuan and Terry M. Peters},
journal= {arXiv preprint arXiv:1405.0892},
year = {2014}
}
Comments
10 pages, 2 figures, 3 algorithms - v2: Fixed typos / grammatical errors and mathematical errors in the primal/dual formulation. Extended methods for weighted DAGs rather than DAGs with edge multiplicity