In this work, we study the problems of computing spatially continuous cuts, which has many important applications of image processing and computer vision. We focus on the convex relaxed formulations and investigate the corresponding flow-maximization based dual formulations. We propose a series of novel continuous max-flow models based on evaluating different constraints of flow excess, where the classical pre-flow and pseudo-flow models over graphs are re-discovered in the continuous setting and re-interpreted in a new variational manner. We propose a new generalized proximal method, which is based on a specific entropic distance function, to compute the maximum flow. This leads to new algorithms exploring flow-maximization and message-passing simultaneously. We show the proposed algorithms are superior to state of art methods in terms of efficiency.
CITATION STYLE
Bae, E., Tai, X. C., & Yuan, J. (2015). Maximizing flows with message-passing: Computing spatially continuous min-cuts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8932, pp. 15–28). Springer Verlag. https://doi.org/10.1007/978-3-319-14612-6_2
Mendeley helps you to discover research relevant for your work.