Title
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.'
Year
Venue
Field
2014
arXiv: Computer Vision and Pattern Recognition
Mathematical optimization,Pattern recognition,Segmentation,Computer science,Algorithm,Directed acyclic graph,Regularization (mathematics),Artificial intelligence,Maximum flow problem
DocType
Volume
Citations 
Journal
abs/1405.0892
5
PageRank 
References 
Authors
0.49
3
4
Name
Order
Citations
PageRank
John S. H. Baxter17414.67
Martin Rajchl242134.67
Jing Yuan337223.02
Terry M. Peters41335181.71