Combinatorial Continuous Maximum Flow

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cut algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching, and texture synthesis. Algorithms based on the classical formulation of max-flow defined on a graph are known to exhibit metrication artifacts in the solution. Therefore, a recent trend has been to instead employ a spatially continuous maximum flow (or the dual min-cut problem) in these same applications to produce solutions with no metrication errors. However, known fast continuous max-flow algorithms have no stopping criteria or have not been proved to converge. In this work, we revisit the continuous max-flow problem and show that the analogous discrete formulation is different from the classical max-flow problem. We then apply an appropriate combinatorial optimization technique to this combinatorial continuous max-flow (CCMF) problem to find a null-divergence solution that exhibits no metrication artifacts and may be solved exactly by a fast, efficient algorithm with provable convergence. Finally, by exhibiting the dual problem of our CCMF formulation, we clarify the fact, already proved by Nozawa in the continuous setting, that the max-flow and the total variation problems are not always equivalent.

[1]  Guy Gilboa,et al.  Nonlocal Linear Image Regularization and Supervised Segmentation , 2007, Multiscale Model. Simul..

[2]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[3]  M. Nikolova An Algorithm for Total Variation Minimization and Applications , 2004 .

[4]  Gilbert Strang,et al.  Maximum flows and minimum cuts in the plane , 2010, J. Glob. Optim..

[5]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[6]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[7]  Xavier Bresson,et al.  Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction , 2010, SIAM J. Imaging Sci..

[8]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods/ J. A. Sethian , 1999 .

[9]  Christopher V. Alvino,et al.  The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph , 2009, IEEE Transactions on Image Processing.

[10]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[11]  Camillo J. Taylor,et al.  Graph Cuts via $\ell_1$ Norm Minimization , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Y. Nesterov Gradient methods for minimizing composite objective function , 2007 .

[13]  Leo Grady,et al.  Discrete Calculus - Applied Analysis on Graphs for Computational Science , 2010 .

[14]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[16]  R. Nozawa,et al.  Max-flow min-cut theorem in an anisotropic network , 1990 .

[17]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[18]  Daniel Cremers,et al.  An algorithm for minimizing the Mumford-Shah functional , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[19]  Daniel Cremers,et al.  A convex approach for computing minimal partitions , 2008 .

[20]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[21]  Gilbert Strang,et al.  Maximal flow through a domain , 1983, Math. Program..

[22]  Ross A. Lippert Discrete Approximations to Continuum Optimal Flow Problems , 2006 .

[23]  Abderrahim Elmoataz,et al.  Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing , 2008, IEEE Transactions on Image Processing.

[24]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[25]  Anil N. Hirani,et al.  Discrete exterior calculus , 2005, math/0508341.

[26]  Jean-Michel Morel,et al.  A non-local algorithm for image denoising , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[27]  Rachid Deriche,et al.  Geodesic Active Regions: A New Framework to Deal with Frame Partition Problems in Computer Vision , 2002, J. Vis. Commun. Image Represent..

[28]  Rüdiger Westermann,et al.  Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation , 2005, MICCAI.

[29]  Jan-Michael Frahm,et al.  Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps , 2008, VMV.

[30]  Hugues Talbot,et al.  Globally minimal surfaces by continuous maximal flows , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[31]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[32]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[33]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[34]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[35]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[36]  D. Shulman,et al.  Regularization of discontinuous flow fields , 1989, [1989] Proceedings. Workshop on Visual Motion.

[37]  Eitan Grinspun,et al.  Sparse matrix solvers on the GPU: conjugate gradients and multigrid , 2003, SIGGRAPH Courses.

[38]  Rüdiger Westermann,et al.  Linear algebra operators for GPU implementation of numerical algorithms , 2003, SIGGRAPH Courses.

[39]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[40]  Wotao Yin,et al.  Second-order Cone Programming Methods for Total Variation-Based Image Restoration , 2005, SIAM J. Sci. Comput..

[41]  Ryôhei Nozawa,et al.  Examples of max-flow and min-cut problems with duality gaps in continuous networks , 1994, Math. Program..

[42]  Leo Grady,et al.  Faster graph-theoretic image processing via small-world and quadtree topologies , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[43]  Daniel Cremers,et al.  TVSeg - Interactive Total Variation Based Image Segmentation , 2008, BMVC.

[44]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[45]  Daniel Cremers,et al.  A Convex Formulation of Continuous Multi-label Problems , 2008, ECCV.

[46]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[47]  Jérôme Darbon,et al.  Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases , 2006, Journal of Mathematical Imaging and Vision.

[48]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.