arXiv · 1405.0892
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.'
Explore related subjects
Keep this discovery
John S. H. Baxter, Martin Rajchl, Jing Yuan, Terry M. Peters. 2014-05-05. A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization. https://arxiv.org/abs/1405.0892
Cite the original work for its findings. Save a collection to share your selection of sources.