Numerical solution of a model problem from collapse load analysis
Proc. of the sixth int'l. symposium on Computing methods in applied sciences and engineering, VI
Combinatorica
On maximum flows in polyhedral domains
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Examples of max-flow and min-cut problems with duality gaps in continuous networks
Mathematical Programming: Series A and B
Regular Article: Duality Theorems for a Continuous Analog of Ford-Fulkerson Flows in Networks
Advances in Applied Mathematics
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms in C
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Globally Minimal Surfaces by Continuous Maximal Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
An improved riemannian metric approximation for graph cuts
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Global relabeling for continuous optimization in binary image segmentation
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Combinatorial Continuous Maximum Flow
SIAM Journal on Imaging Sciences
| Hi-index | 0.00 |
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint ||(v 1, v 2)|| 驴 c(x, y). The dual problem finds a minimum cut 驴 S which is filled to capacity by the flow through it. This model problem has found increasing application in medical imaging, and the theory continues to develop (along with new algorithms). Remaining difficulties include explicit streamlines for the maximum flow, and constraints that are analogous to a directed graph.