M. Kass, A. Witkin, and D. Terzopoulos, Snakes: Active contour models, International Journal of Computer Vision, vol.5, issue.6035, pp.321-331, 1988.
DOI : 10.1007/BF00133570

J. A. Sethian, Level Set Methods and Fast Marching Methods, 1999.

N. Paragios, Geodesic Active Regions and Level Set Methods : Contributions and Applications in Artificial Vision, 2000.

Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.11, pp.1222-1239, 2001.
DOI : 10.1109/34.969114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6806

H. Ishikawa, Exact optimization for markov random fields with convex priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.10, pp.1333-1336, 2003.
DOI : 10.1109/TPAMI.2003.1233908

J. Darbon and M. Sigelle, Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases, Journal of Mathematical Imaging and Vision, vol.39, issue.4, pp.277-291, 2006.
DOI : 10.1007/s10851-006-0644-3

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

Y. Boykov and M. P. Jolly, Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.105-112, 2001.
DOI : 10.1109/ICCV.2001.937505

V. Kolmogorov and R. Zabin, What energy functions can be minimized via graph cuts? PAMI, pp.147-159, 2004.
DOI : 10.1109/tpami.2004.1262177
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1823

B. Appleton and H. Talbot, Globally minimal surfaces by continuous maximal flows, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.1, pp.106-118, 2006.
DOI : 10.1109/TPAMI.2006.12
URL : https://hal.archives-ouvertes.fr/hal-00621983

Y. Boykov and V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, Proceedings Ninth IEEE International Conference on Computer Vision, pp.3-26, 2003.
DOI : 10.1109/ICCV.2003.1238310
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.6433

A. Chambolle, An algorithm for total variation minimization and applications, J. Math. Imaging Vis, vol.20, pp.89-97, 2004.

M. Nikolova, S. Esedoglu, and T. F. Chan, Algorithms for finding global minimizers of image segmentation and denoising models, SIAM JAM, vol.66, pp.1632-1648, 2006.

M. Iri, Theory of flows in continua as approximation to flows in networks, Survey of Mathematical Programming, 1979.

G. Strang, Maximum flows through a domain, Math. Prog, pp.123-143, 1983.

M. Unger, T. Pock, W. Trobin, D. Cremers, and H. Bischof, TVSeg - Interactive Total Variation Based Image Segmentation, Procedings of the British Machine Vision Conference 2008, 2008.
DOI : 10.5244/C.22.40

M. Unger, T. Pock, and H. Bischof, Interactive globally optimal image segmentation, 2008.

T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, A Convex Formulation of Continuous Multi-label Problems, pp.8-792, 2008.
DOI : 10.1007/978-3-540-88690-7_59

C. Zach, D. Gallup, J. M. Frahm, and M. Niethammer, Fast global labeling for real-time stereo using multiple plane sweeps, In: Vis. Mod. Vis, 2008.

A. Chambolle, D. Cremers, and T. Pock, A convex approach for computing minimal partitions, Tech. Rep. Ecole Polytechnique CMAP, vol.649, 2008.

A. Chambolle and T. Pock, A First-Order Primal-Dual Algorithm for Convex Problems with??Applications to Imaging, Journal of Mathematical Imaging and Vision, vol.60, issue.5, p.685, 2010.
DOI : 10.1007/s10851-010-0251-1
URL : https://hal.archives-ouvertes.fr/hal-00490826

G. Strang, Maximum flows and minimum cuts in the plane, Journal of Global Optimization, 2008.

D. Shulman and J. H. , Regularization of discontinuous flow fields, [1989] Proceedings. Workshop on Visual Motion, pp.81-86, 1989.
DOI : 10.1109/WVM.1989.47097

L. I. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms, Physica D: Nonlinear Phenomena, vol.60, issue.1-4, pp.259-268, 1992.
DOI : 10.1016/0167-2789(92)90242-F

Y. Nesterov, Gradient methods for minimizing composite objective function. CORE Discussion Papers, Center for Operations Research and Econometrics (CORE), 2007.

T. Goldstein and S. Osher, The Split Bregman Method for L1-Regularized Problems, SIAM Journal on Imaging Sciences, vol.2, issue.2, pp.323-343, 2009.
DOI : 10.1137/080725891

X. Zhang, M. Burger, X. Bresson, and S. Osher, Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction, SIAM Journal on Imaging Sciences, vol.3, issue.3, 2009.
DOI : 10.1137/090746379
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.1059

R. Nozawa, Max-flow min-cut theorem in an anisotropic network, Osaka J. Math, vol.27, pp.805-842, 1990.

R. Nozawa, Examples of max-flow and min-cut problems with duality gaps in continuous networks, Mathematical Programming, vol.20, issue.1-3, pp.213-234, 1994.
DOI : 10.1007/BF01582067

C. L. Fefferman, Existence and smoothness of the Navier-Stokes equation, 2000.

A. N. Hirani, Discrete exterior calculus, Cal. Tech, 2003.

L. J. Grady and J. R. Polimeni, Discrete Calculus: Applied Analysis on Graphs for Computational Science, 2010.
DOI : 10.1007/978-1-84996-290-2

A. Elmoataz, O. Lézoray, and S. Bougleux, Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing, IEEE Transactions on Image Processing, vol.17, issue.7, pp.1047-1060, 2008.
DOI : 10.1109/TIP.2008.924284
URL : https://hal.archives-ouvertes.fr/hal-00163573

L. Grady and C. Alvino, The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph, IEEE Transactions on Image Processing, vol.18, issue.11, pp.2547-2561, 2009.
DOI : 10.1109/TIP.2009.2028258

R. A. Lippert, Discrete Approximations to Continuum Optimal Flow Problems, Studies in Applied Mathematics, vol.11, issue.3, pp.321-333, 2006.
DOI : 10.1016/S0024-3795(98)10032-0

A. Bhusnurmath and C. J. Taylor, Graph Cuts via $\ell_1$ Norm Minimization, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.10, pp.1866-1871, 2008.
DOI : 10.1109/TPAMI.2008.82

D. Goldfarb and W. Yin, Second-order Cone Programming Methods for Total Variation-Based Image Restoration, SIAM Journal on Scientific Computing, vol.27, issue.2, pp.622-645, 2005.
DOI : 10.1137/040608982

A. Buades, B. Coll, and J. M. Morel, A Non-Local Algorithm for Image Denoising, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.60-65, 2005.
DOI : 10.1109/CVPR.2005.38

L. Grady and E. L. Schwartz, Faster graph-theoretic image processing via small-world and quadtree topologies, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004., pp.360-365, 2004.
DOI : 10.1109/CVPR.2004.1315186
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3218

V. Caselles, R. Kimmel, and G. Sapiro, Geodesic active contours, Proceedings of IEEE International Conference on Computer Vision, pp.61-79, 1997.
DOI : 10.1109/ICCV.1995.466871

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, STOC Theory of computing, vol.86, pp.136-146, 1986.

J. Bolz, I. Farmer, E. Grinspun, and P. Schröder, Sparse matrix solvers on the GPU, ACM Transactions on Graphics, vol.22, issue.3, pp.917-924, 2003.
DOI : 10.1145/882262.882364

J. Kruger and R. Westermann, Linear algebra operators for GPU implementation of numerical algorithms, In: SIGGRAPH, pp.908-916, 2003.

L. Grady, T. Schiwetz, S. Aharon, and R. Westermann, Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation, Proc. In'l Conf. Medical Image Computing and Computer-Assisted Intervention, pp.773-780, 2005.
DOI : 10.1007/11566489_95

G. Gilboa and S. Osher, Nonlocal Linear Image Regularization and Supervised Segmentation, Multiscale Modeling & Simulation, vol.6, issue.2, pp.595-630, 2007.
DOI : 10.1137/060669358

T. Pock, D. Cremers, H. Bischof, and A. Chambolle, An algorithm for minimizing the Mumford-Shah functional, 2009 IEEE 12th International Conference on Computer Vision, 2009.
DOI : 10.1109/ICCV.2009.5459348

C. Rother, V. Kolmogorov, and A. Blake, GrabCut " ? Interactive foreground extraction using iterated graph cuts, In: SIGGRAPH, pp.309-314, 2004.

W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, pp.452-473, 1977.
DOI : 10.1086/jar.33.4.3629752