M. V. Afonso, J. M. Dias, and M. A. Figueiredo, An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems, IEEE Transactions on Image Processing, vol.20, issue.3

C. Alì-ene, J. Audibert, M. Couprie, J. Cousty, and R. Keriven, Some links between min cuts, optimal spanning forests and watersheds, 7th international symposium on mathematical morphology ISMM'07, pp.253-264, 2007.

C. Alì-ene, J. Audibert, M. Couprie, and R. Keriven, Some links between extremum spanning forests, watersheds and min-cuts, Image and Vision Computing, vol.28, issue.10, pp.1460-1471, 2009.

C. V. Alvino, G. B. Unal, G. Slabaugh, B. Peny, and T. Fang, Efficient segmentation based on Eikonal and diffusion equations, International Journal of Computer Mathematics, vol.84, issue.9, pp.1309-1324, 2007.
DOI : 10.1109/34.56205

N. Amenta, S. Choi, and R. K. Kolluri, The power crust, Proceedings of the sixth ACM symposium on Solid modeling and applications , SMA '01, pp.249-266, 2001.

A. Anandkumar, L. Tong, and A. Swami, Detection of Gauss-Markov Random Field on Nearest-Neighbor Graph, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07, pp.7-130, 2007.

J. Angulo and D. Jeulin, Stochastic watershed segmentation, Proceedings of the 8th International Symposium on Mathematical Morphology, ISMM'07, pp.265-276, 2007.

B. Appleton and H. Talbot, Globally minimal surfaces by continuous maximal flows, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.1

P. A. Arbeláez and L. D. Cohen, A Metric Approach to Vector-Valued Image Segmentation, International Journal of Computer Vision, vol.133, issue.2, pp.119-126, 2006.

R. Audigier and R. Lotufo, Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency, Journal of Mathematical Imaging and Vision, vol.13, issue.6, pp.157-173, 2007.

J. Aujol, Some First-Order Algorithms for Total Variation Based Image Restoration, Journal of Mathematical Imaging and Vision, vol.33, issue.2, pp.307-327, 2009.

D. Auroux, Fast algorithms for image processing and data assimilation, 2008.

L. Bagnato, P. Frossard, and P. Vandergheynst, Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs, 2009 16th IEEE International Conference on Image Processing (ICIP), pp.1453-1456, 2009.

X. Bai and G. Sapiro, Geodesic Matting: A Framework for Fast Interactive Image and??Video Segmentation and Matting, Proceedings of International Conference of Computer Vision (ICCV), p.72, 2007.

F. Benmansour and L. D. Cohen, Tubular Structure Segmentation Based on Minimal Path Method and Anisotropic Enhancement, International Journal of Computer Vision, vol.31, issue.2???3, pp.192-210, 2011.

G. Bertrand, On Topological Watersheds, Journal of Mathematical Imaging and Vision, vol.34, issue.6, pp.217-230, 2005.

D. P. Bertsekas, Projected newton methods for optimization problems with simple constraints, SIAM J. Control and Optimization, p.124, 1982.

S. Beucher and C. Gratin, Micromorph reference manual, applications and solutions

S. Beucher and F. Meyer, The morphological approach to segmentation: The watershed transformation, Mathematical Morphology in Image Processing, pp.433-481, 1993.

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.

A. Bieniek and A. Moga, An efficient watershed algorithm based on connected components, Pattern Recognition, vol.33, issue.6, pp.907-916, 2000.

A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, Interactive Image Segmentation Using an Adaptive GMMRF Model, Proceedings of European Conference on Computer Vision (ECCV), pp.428-441, 2004.

A. Blake and A. Zisserman, Visual Reconstruction, p.71, 1987.

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.

S. Bougleux, A. Elmoataz, and M. Melkemi, Discrete Regularization on Weighted Graphs for Image and Mesh Filtering, Proceedings of International Conference on Scale Space and Variational Methods in Computer Vision, SSVM '07, pp.128-139, 2007.

C. Bouman and K. Sauer, A generalized Gaussian image model for edge-preserving MAP estimation, IEEE Transactions on Image Processing, vol.2, issue.3, pp.296-310, 1993.
DOI : 10.1109/83.236536

Y. Boykov and M. 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.

Y. Boykov and V. Kolmogorov, An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, IEEE Trans. on PAMI, vol.26, issue.8, pp.359-374, 2001.

Y. Boykov and V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, Proceedings Ninth IEEE International Conference on Computer Vision, p.71, 2003.

Y. Boykov, V. Kolmogorov-boykov, O. Veksler, and R. Zabih, An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.9, pp.1124-1137, 2001.

J. P. Boyle and R. L. Dykstra, A method for finding projections onto the intersection of convex sets in hilbert spaces Advances in order restricted statistical inference, Lecture Notes in Statist, vol.37, pp.2847-52, 1985.

I. Braude, J. Marker, K. Museth, J. Nissanov, and D. Breen, Contour-based surface reconstruction using MPU implicit models, Graphical Models, vol.69, issue.2, p.111, 2007.

K. Bredies, K. Kunisch, and T. Pock, Total Generalized Variation, SIAM Journal on Imaging Sciences, vol.3, issue.3, pp.492-526, 2010.
DOI : 10.1137/090769521

K. Bredies, K. Kunisch, and T. Valkonen, Properties of l 1 -TGV 2 : The onedimensional case, p.48, 2011.

E. Breen and R. Jones, Attribute Openings, Thinnings, and Granulometries, Computer Vision and Image Understanding, vol.64, issue.3, pp.377-389, 1996.

E. J. Breen and R. Jones, Attribute Openings, Thinnings, and Granulometries, Computer Vision and Image Understanding, vol.64, issue.3

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.

X. Bresson, S. Esedoglu, P. Vandergheynst, J. Thiran, and S. Osher, Fast Global Minimization of the Active Contour/Snake Model, Journal of Mathematical Imaging and Vision, vol.7, issue.3, pp.151-167, 2007.

L. , B. Arias, and P. L. Combettes, A monotone+skew splitting model for composite monotone inclusions in duality, pp.17-57, 2010.

A. Buades, B. Coll, and J. 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

J. Carter, Dual Methods for Total Variation-based Image Restoration, p.47, 2001.

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

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

A. Chambolle, V. Caselles, M. Novaga, D. Cremers, and T. Pock, An introduction to Total Variation for Image Analysis, 2010.

A. Chambolle, D. Cremers, and T. Pock, A convex approach for computing minimal partitions, Tech. Rep, vol.649, 1921.

A. Chambolle, S. E. Levine, J. Bradley, and . Lucier, An Upwind Finite-Difference Method for Total Variation???Based Image Smoothing, SIAM Journal on Imaging Sciences, vol.4, issue.1, pp.277-299, 2011.
DOI : 10.1137/090752754

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, pp.120-145, 2011.

T. F. Chan, G. H. Golub, and P. Mulet, A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration, SIAM Journal on Scientific Computing, vol.20, issue.6, pp.1964-1977, 1999.

C. Chaux, A. Jezierska, J. Pesquet, and H. Talbot, A Spatial Regularization Approach for Vector Quantization, Journal of Mathematical Imaging and Vision, vol.6, issue.4, p.99, 2010.

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the ACM, vol.47, issue.6, pp.1028-1047, 2000.

G. Chen and M. Teboulle, A proximal-based decomposition method for convex minimization problems, Mathematical Programming, vol.29, issue.1-3, pp.81-101, 1994.
DOI : 10.1007/BF01582566

I. Ciril and J. Darbon, Image Denoising with a Constrained Discrete Total Variation Scale Space, Proceedings of Discrete Geometry for Computer Imagery, pp.465-476, 2011.

L. D. Cohen, Minimal paths and fast marching methods for image analysis Mathematical Models in Computer Vision: The Handbook, Nikos Paragios and Yunmei Chen and Olivier Faugeras Editors, 2005.

L. D. Cohen and R. Kimmel, Global minimum for active contour models: a minimal path approach, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.57-78, 1997.

. Zucker, Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps, Proceedings of the National Academy of Sciences, pp.7426-7431, 2005.

P. L. Combettes, D. D?ungd?ung, and B. C. V?uv?u, Dualization of Signal Recovery Problems, Set-Valued and Variational Analysis, vol.1, issue.3-4, p.52, 2009.

P. L. Combettes and J. Pesquet, Image Restoration Subject to a Total Variation Constraint, IEEE Transactions on Image Processing, vol.13, issue.9, pp.1213-1222, 2004.

P. L. Combettes and J. Pesquet, Proximal Thresholding Algorithm for Minimization over Orthonormal Bases, SIAM Journal on Optimization, vol.18, issue.4, pp.1351-1376, 2007.

P. L. Combettes and J. Pesquet, A proximal decomposition method for solving convex variational inverse problems, Inverse Problems, vol.24, issue.6, pp.53-62, 2008.

P. L. Combettes, J. Pesquet, H. H. Bauschke, R. Burachik, P. L. Combettes et al., Proximal Splitting Methods in Signal Processing, Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp.185-212, 2010.

P. Coupé, P. Hellier, S. Prima, C. Kervrann, and C. Barillot, 3D Wavelet Subbands Mixing for Image Denoising, International Journal of Biomedical Imaging, vol.6, pp.1-11, 2008.
DOI : 10.1109/42.712135

C. Couprie, X. Bresson, L. Najman, H. Talbot, and L. Grady, Surface Reconstruction Using Power Watershed, Proc. of International Symposium on Mathematical Morphology, pp.381-392, 2011.

C. Couprie, L. Grady, L. Najman, and H. Talbot, Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest, 2009 IEEE 12th International Conference on Computer Vision, pp.731-738, 2009.

C. Couprie, L. Grady, L. Najman, and H. Talbot, Anisotropic diffusion using power watersheds, 2010 IEEE International Conference on Image Processing, p.91, 2010.

C. Couprie, L. Grady, L. Najman, and H. Talbot, Power Watershed: A Unifying Graph-Based Optimization Framework, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.7, p.104, 2011.

C. Couprie, L. Grady, H. Talbot, and L. Najman, Combinatorial Continuous Maximum Flow, SIAM Journal on Imaging Sciences, vol.4, issue.3, p.51, 2011.
DOI : 10.1137/100799186

C. Couprie, H. Talbot, J. Pesquet, L. Najman, and L. J. Grady, Dual constrained TV-based regularization, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.945-948, 1947.

M. Couprie, L. Najman, and G. Bertrand, Quasi-Linear Algorithms for the Topological Watershed, Journal of Mathematical Imaging and Vision, vol.13, issue.6, pp.231-249, 2005.

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed cuts, 7th international symposium on mathematical morphology (ISMM '07), pp.301-312

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.8, pp.311362-1374, 2009.

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.32, issue.5, pp.925-939, 2010.

A. Criminisi, T. Sharp, and A. Blake, GeoS: Geodesic Image Segmentation, Proceedings of European Conference on Computer Vision (ECCV), pp.99-112, 2008.

J. H. Shulman, Regularization of discontinuous flow fields, [1989] Proceedings. Workshop on Visual Motion, pp.81-86, 1989.

J. Darbon and M. Sigelle, Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization, Journal of Mathematical Imaging and Vision, vol.2, issue.4, pp.261-276, 2006.

J. Darbon and M. Sigelle, Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization, Journal of Mathematical Imaging and Vision, vol.2, issue.4, pp.261-276, 2006.

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.

T. , D. Mazancourt, and D. Gerlic, The inverse of a block-circulant matrix, IEEE Trans. on Antennas and Propagation, vol.31, issue.5, pp.808-810, 1983.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, p.269271, 1959.
DOI : 10.1007/BF01386390

O. Duchenne, J. Audibert, R. Keriven, J. Ponce, and F. Ségonne, Segmentation by transduction, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.71, 2008.

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.

N. El-zehiry and L. Grady, Fast global optimization of curvature, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.116, 2010.

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.

E. Esser, X. Zhang, and T. F. Chan, A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science, SIAM Journal on Imaging Sciences, vol.3, issue.4, pp.1015-1046, 2010.
DOI : 10.1137/09076934X

A. X. Falcão, R. A. Lotufo, and G. Araujo, The image foresting transform: theory, algorithms, and applications, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.1, pp.19-29, 2004.

A. X. Falcão, J. K. Udupa, S. Samarasekera, S. Sharma, B. H. Elliot et al., User-Steered Image Segmentation Paradigms: Live Wire and Live Lane, Graphical Models and Image Processing, vol.60, issue.4

A. X. Falcao, J. Stolfi, and . De-alencar, The image foresting transform: theory, algorithms, and applications, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.1, pp.19-29, 2004.

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

P. Felzenszwalb and D. Huttenlocher, Efficient Graph-Based Image Segmentation, International Journal of Computer Vision, vol.59, issue.2

B. Fischer and J. Modersitzki, Fast inversion of matrices arising in image processing. Numerical Algorithms, p.54

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.

D. Geman and G. Reynolds, Constrained restoration and the recovery of discontinuities, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.14, issue.3, pp.367-383, 0130.
DOI : 10.1109/34.120331

S. Geman and D. Geman, Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Trans. on PAMI, vol.6, issue.6, pp.721-741, 1984.

S. Geman and D. Mcclure, Statistical methods for tomographic image reconstruction

T. Géraud, H. Talbot, and M. Van-droogenbroeck, Algorithms for Mathematical Morphology, Mathematical morphology: from theory to applications, pp.345-373, 2010.

G. Gilboa, J. Darbon, S. Osher, and T. Chan, Nonlocal convex functionals for image regularization, UCLA CAM Report, pp.6-57, 2006.

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

R. Glowinski and P. Tallec, Augmented Lagrangian and operator-splitting methods in nonlinear mechanics, Studies in Applied Mathematics, SIAM, p.109, 1989.

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem

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

T. Goldstein, X. Bresson, and S. Osher, Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction, Journal of Scientific Computing, vol.80, issue.3, 2009.

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

L. Grady, Space-Variant Computer Vision: A Graph-Theoretic Approach, p.67, 2004.

L. Grady-]-l and . Grady, Random Walks for Image Segmentation, Proceedings of European Conference on Computer Vision (ECCV), pp.1768-1783, 2006.

L. Grady, Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.32, issue.2, pp.321-334, 1971.

L. Grady and C. Alvino, The Piecewise Smooth Mumford&#x2013;Shah Functional on an Arbitrary Graph, IEEE Transactions on Image Processing, vol.18, issue.11, pp.2547-2561, 2004.

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

L. Grady and E. L. Schwartz, Anisotropic interpolation on graphs: The combinatorial dirichlet problem, 2003.

L. Grady and E. L. Schwartz, The Graph Analysis Toolbox: Image processing on arbitrary graphs, p.134, 2003.

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, 1923.

L. Grady and A. K. Sinop, Fast approximate Random Walker segmentation using eigenvector precomputation, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.71, 2008.

L. J. Grady and J. R. Polimeni, Discrete Calculus: Applied Analysis on Graphs for Computational Science, p.74, 2010.

D. M. Greig, B. T. Porteous, and A. H. Seheult, Exact maximum a posteriori estimation for binary images, Journal of the Royal Statistical Society, vol.51, issue.74, pp.271-279, 1989.

L. Guigues, J. P. Cocquerez, and H. L. Men, Scale-Sets Image Analysis, International Journal of Computer Vision, vol.20, issue.6, pp.289-317, 2006.

P. Guillataud, Contribution l'analyse dendroniques des images, p.130, 1992.

P. Hanusse and P. Guillataud, Sémantique des images par analyse dendronique, 8` eme Reconnaissance des Formes et Intelligence Artificielle (RFIA), pp.577-588, 1992.

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

T. Hirata, A unified linear-time algorithm for computing distance maps, Information Processing Letters, vol.58, issue.3, pp.129-133, 1996.

D. S. Hochbaum and V. Singh, An efficient algorithm for Co-segmentation, 2009 IEEE 12th International Conference on Computer Vision, p.116, 2009.

H. Hoppe, T. Derose, T. Duchamp, J. Mcdonald, and W. Stuetzle, Surface reconstruction from unorganized points, ACM SIGGRAPH Computer Graphics, vol.26, issue.2, pp.71-78, 1992.

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

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.

K. Jalalzai and A. Chambolle, Enhancement of Blurred and Noisy Images Based on an Original Variant of the Total Variation, Proceedings of International Conference on Scale Space and Variational Methods in Computer Vision, SSVM '09, pp.368-376, 2009.

A. C. Jalba and J. B. Roerdink, Efficient Surface Reconstruction using Generalized Coulomb Potentials, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.6, pp.1512-1519, 2007.

R. Jenatton, J. Mairal, G. Obozinski, and F. Bach, Proximal methods for hierarchical sparse coding, Journal of Machine Learning Research, vol.12, pp.2297-2334, 2011.

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

J. P. Kaufhold, Energy Formulations of Medical Image Segmentations, p.130, 2000.

M. Kazhdan, M. Bolitho, and H. Hoppe, Poisson surface reconstruction, Proceedings of the fourth Eurographics symposium on Geometry processing, SGP '06, pp.61-70

S. Aire-la-ville, Eurographics Association, p.111, 2006.

M. M. Kazhdan, Reconstruction of solid models from oriented point sets, Symposium on Geometry Processing, pp.73-82, 2005.

S. Kim, K. Koh, M. Lustig, and S. Boyd, An Efficient Method for Compressed Sensing, 2007 IEEE International Conference on Image Processing, pp.117-120

P. Kohli, M. P. Kumar, and P. Torr, P3 & Beyond: Solving Energies with Higher Order Cliques, 2007 IEEE Conference on Computer Vision and Pattern Recognition, p.72, 2007.

P. Kohli, L. Ladicky, and P. Torr, Robust higher order potentials for enforcing label consistency, Proceedings of IEEE Conference in Computer Vision and Pattern Recognition (CVPR), p.72, 2008.

V. Kolmogorov and R. Zabih, Computing visual correspondence with occlusions via graph cuts, Proceedings of International Conference of Computer Vision (ICCV), pp.508-515, 2001.

V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.2, pp.147-159, 2004.

K. Krajsek and H. Scharr, Diffusion filtering without parameter tuning: Models and inference tools, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.130, 2010.

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

V. Lempitsky, Surface extraction from binary volumes with higher-order smoothness, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.107, 2010.

V. Lempitsky and Y. Boykov, Global Optimization for Shape Fitting, 2007 IEEE Conference on Computer Vision and Pattern Recognition, p.103, 2007.

V. S. Lempitsky, S. Roth, and C. Rother, FusionFlow: Discrete-continuous optimization for optical flow estimation, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.89, 2008.

A. Levin, D. Lischinski, and Y. Weiss, A Closed-Form Solution to Natural Image Matting, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.2, pp.228-242, 2008.

E. Levitan and G. Herman, A Maximum a Posteriori Probability Expectation Maximization Algorithm for Image Reconstruction in Emission Tomography, IEEE Transactions on Medical Imaging, vol.6, issue.3, pp.185-192, 0130.

Y. Li and D. P. Huttenlocher, Learning for Optical Flow Using Stochastic Optimization, Proceedings of European Conference on Computer Vision (ECCV), pp.379-391, 2008.

Y. Li, J. Sun, C. Tang, and H. Shum, Lazy snapping, SIGGRAPH, pp.303-308, 2004.

P. L. Lions and B. Mercier, Splitting Algorithms for the Sum of Two Nonlinear Operators, SIAM Journal on Numerical Analysis, vol.16, issue.6
DOI : 10.1137/0716071

R. A. Lippert, Discrete Approximations to Continuum Optimal Flow Problems, Studies in Applied Mathematics, vol.11, issue.3, pp.321-333, 2006.

F. Malgouyres, Minimizing the total variation under a general convex constraint for image restoration, IEEE Transactions on Image Processing, vol.11, issue.12, pp.1450-1456, 2002.

P. Matas, E. Dokládalova, M. Akil, T. Grandpierre, L. Najman et al., Parallel Algorithm for Concurrent Computation of Connected Component Tree, Advanced Concepts for Intelligent Vision Systems (ACIVS'08), pp.230-241, 0131.

F. Meyer, Minimum Spanning Forests for Morphological Segmentation, Proceedings of international symposium on mathematical morphology (ISMM'94), pp.77-84, 1994.

F. Meyer and S. Beucher, Morphological segmentation, Journal of Visual Communication and Image Representation, vol.1, issue.1, pp.21-46, 0131.

F. Meyer and L. Najman, Segmentation, Minimum Spanning Tree and Hierarchies, Mathematical morphology: from theory to applications , chapter 9, pp.255-287, 2010.

H. S. Michael, M. J. Black, H. W. Haussecker-]-e, W. A. Mortensen, and . Barrett, Image statistics and anisotropic diffusion Intelligent scissors for image composition, Proceedings of International Conference of Computer Vision (ICCV) Proceedings of the 22nd annual conference on Computer graphics and interactive techniques , SIGGRAPH '95, pp.840-847, 1995.

E. N. Mortensen and W. A. Barrett, Interactive Segmentation with Intelligent Scissors, Graphical Models and Image Processing, vol.60, issue.5, pp.349-384, 1998.

D. Mumford and J. Shah, Optimal approximations by piecewise smooth functions and associated variational problems, Communications on Pure and Applied Mathematics, vol.3, issue.5, p.92

L. Najman, Ultrametric Watersheds, 9th international symposium on mathematical morphology (ISMM'09), pp.181-192, 2009.

L. Najman, Ultrametric Watersheds, p.115, 1887.

L. Najman and M. Couprie, Building the Component Tree in Quasi-Linear Time, IEEE Transactions on Image Processing, vol.15, issue.11, pp.3531-3539, 2006.

L. Najman and M. Schmitt, Watershed of a continuous function, Special issue on Mathematical Morphology, pp.99-112, 1994.

L. Najman and M. Schmitt, Geodesic saliency of watershed contours and hierarchical segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.12, pp.1163-1173, 1996.

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

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

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

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

M. D. Morris and A. G. Constantinides, Graph theory for image analysis: an approach based on the shortest spanning tree, IEEE Proc. on Communication, Radar, and Signal, pp.146-152, 1986.

C. H. Papadimitriou and K. Streiglitz, Combinatorial optimization, algorithms and complexity, 1998.

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

P. Perona and J. Malik, Scale-space and edge detection using anisotropic diffusion, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.7
DOI : 10.1109/34.56205

J. Pesquet and N. Pustelnik, A parallel inertial proximal optimization method, p.53, 2011.

G. Peyre and L. D. Cohen, Geodesic Methods for Shape and Surface Processing, chapter Advances in Computational Vision and Medical Image Processing: Methods and Applications, pp.29-56, 2008.

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, p.34, 2009.

T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, A Convex Formulation of Continuous Multi-label Problems, Proceedings of European Conference on Computer Vision (ECCV), pp.792-805, 2008.

T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, A Convex Formulation of Continuous Multi-label Problems, Proceedings of the 10th European Conference on Computer Vision: Part III, ECCV '08, pp.792-805, 2008.

R. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.

N. Pustelnik, Proximal methods for the resolution of inverse problems : application to positron emission tomography, p.16, 2010.

N. Pustelnik, C. Chaux, and J. Pesquet, Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization, IEEE Transactions on Image Processing, vol.20, issue.9, p.48, 2011.

E. R. Goldenberg, R. Kimmel, and M. Rudzsky, Fast geodesic active contours, IEEE Transactions on Image Processing, vol.10, issue.10, pp.1467-1475883, 1993.
DOI : 10.1109/83.951533

J. Roerdink and A. Meijster, The watershed transform: Definitions, algorithms, and parallellization strategies, Fund. Informaticae, vol.41, issue.70, pp.187-228, 2000.

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

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.

P. Salembier, A. Oliveras, and L. Garrido, Antiextensive connected operators for image and sequence processing, IEEE Transactions on Image Processing, vol.7, issue.4, pp.555-570, 0130.
DOI : 10.1109/83.663500

K. G. Samuel and M. F. Tappen, Learning optimized MAP estimates in continuously-valued MRF models, 2009 IEEE Conference on Computer Vision and Pattern Recognition, p.130, 2009.

D. Scharstein and R. Szeliski, A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001), pp.7-42, 2001.

U. Schmidt, Q. Gao, and S. Roth, A generative perspective on MRFs in low-level vision, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.130, 2010.

J. A. Sethian, Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics

S. Setzer, Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage, International Conference on Scale Space and Variational Methods in Computer Vision, SSVM '09, pp.464-476, 2009.
DOI : 10.1137/080724265

R. Shen, I. Cheng, X. Li, and A. Basu, Stereo matching using random walks, 2008 19th International Conference on Pattern Recognition, p.89, 2008.

J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Trans. on PAMI, vol.22, issue.8, pp.888-905, 2000.

D. Singaraju, L. Grady, A. K. Sinop, and R. Vidal, Continuous valued MRFs for image segmentation, Advances in Markov Random Fields for Vision and Image Processing, p.128, 2010.

D. Singaraju, L. Grady, and R. Vidal, P-brush: Continuous valued MRFs with normed pairwise distributions for image segmentation, 2009 IEEE Conference on Computer Vision and Pattern Recognition, p.74, 2009.

A. K. Sinop and L. Grady, A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm, 2007 IEEE 11th International Conference on Computer Vision, pp.72-73, 2007.

M. Stoer and F. Wagner, A simple min-cut algorithm, Journal of the ACM, vol.44, issue.4, pp.585-591, 1997.

G. Strang, 1 and l ? approximation of vector fields in the plane In Nonlinear Partial Differential Equations in Applied Science, Proceedings of the U.S. -Japan Seminar, pp.273-288, 1982.

G. Strang, Maximal flow through a domain, Mathematical Programming, vol.19, issue.2, pp.123-143, 1983.
DOI : 10.1007/BF02592050

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

R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov et al., A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.6, pp.1068-1080, 2008.

M. F. Tappen, C. Liu, E. H. Adelson, and W. T. Freeman, Learning Gaussian Conditional Random Fields for Low-Level Vision, 2007 IEEE Conference on Computer Vision and Pattern Recognition, p.130, 2007.

R. E. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.

G. Taubin, T. Zhang, and G. H. Golub, Optimal surface smoothing as filter design, Proceedings of the 4th European Conference on Computer Vision -Volume I, ECCV '96, pp.283-292, 1996.
DOI : 10.1007/BFb0015544

M. Unger, T. Pock, and H. Bischof, Interactive globally optimal image segmentation, pp.31-41, 1921.

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, p.71, 2008.
DOI : 10.5244/C.22.40

E. Van-den, M. P. Berg, and . Friedlander, Probing the Pareto Frontier for Basis Pursuit Solutions, SIAM Journal on Scientific Computing, vol.31, issue.2, pp.890-912, 2008.
DOI : 10.1137/080714488

O. Veksler, Star Shape Prior for Graph-Cut Image Segmentation, Proceedings of the 10th European Conference on Computer Vision: Part III, pp.454-467, 2008.

L. Vese and T. Chan, A multiphase level set framework for image segmentation using the Mumford and Shah model, International Journal of Computer Vision, vol.50, issue.3, pp.271-293, 2002.

S. Vicente, V. Kolmogorov, and C. Rother, Graph cut based image segmentation with connectivity priors, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.71, 2008.

L. Vincent, Morphological grayscale reconstruction in image analysis: applications and efficient algorithms, IEEE Transactions on Image Processing, vol.2, issue.2, pp.176-201, 1993.
DOI : 10.1109/83.217222

L. Vincent and P. Soille, Watersheds in digital spaces: an efficient algorithm based on immersion simulations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.6, pp.583-598, 1991.
DOI : 10.1109/34.87344

M. H. Wilkinson, H. Gao, W. H. Hesselink, J. Jonker, and A. Meijster, Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.10, pp.1800-1813, 2008.

O. Woodford, P. Torr, I. Reid, and A. Fitzgibbon, Global Stereo Reconstruction under Second-Order Smoothness Priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, pp.2115-2128, 2009.

A. Yang, J. Wright, Y. Ma, and S. Sastry, Unsupervised segmentation of natural images via lossy data compression, Computer Vision and Image Understanding, vol.110, issue.2, pp.212-225, 1985.

K. K. Yann-lecun and C. Farabet, Convolutional networks and applications in vision, Proceedings of International Symposium on Circuits and Systems (ISCAS'10), p.116, 2010.

J. Ye, X. Bresson, T. Goldstein, and S. Osher, A fast variational method for surface reconstruction from sets of scattered points, 2010.

V. K. and Y. Boykov, Computing geodesics and minimal surfaces via graph cuts, Proceedings Ninth IEEE International Conference on Computer Vision, pp.26-33, 2003.

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

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.

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, pp.253-276, 2010.
DOI : 10.1137/090746379

H. Zhao, S. Osher, B. Merriman, and M. Kang, Implicit and Nonparametric Shape Reconstruction from Unorganized Data Using a Variational Level Set Method, Computer Vision and Image Understanding, vol.80, issue.3, pp.295-319, 1998.