Application of Graph Partitioning to Image Segmentation

[1]  Michel Couprie,et al.  Some links between extremum spanning forests, watersheds and min-cuts , 2010, Image Vis. Comput..

[2]  Gilles Bertrand,et al.  Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Amir Nakib,et al.  Fractional differentiation and non-Pareto multiobjective optimization for image thresholding , 2009, Eng. Appl. Artif. Intell..

[4]  Daniel Cremers,et al.  Continuous Global Optimization in Multiview 3D Reconstruction , 2007, International Journal of Computer Vision.

[5]  Gilles Bertrand,et al.  Weighted fusion graphs: Merging properties and watersheds , 2008, Discret. Appl. Math..

[6]  Xavier Bresson,et al.  Fast Global Minimization of the Active Contour/Snake Model , 2007, Journal of Mathematical Imaging and Vision.

[7]  Gilles Bertrand,et al.  Fusion Graphs: Merging Properties and Watersheds , 2007, Journal of Mathematical Imaging and Vision.

[8]  Richard Beare.  A locally constrained watershed transform , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[11]  Hugues Talbot,et al.  Globally Optimal Geodesic Active Contours , 2005, Journal of Mathematical Imaging and Vision.

[12]  Jean-Michel Morel,et al.  A Review of Image Denoising Algorithms, with a New One , 2005, Multiscale Model. Simul..

[13]  Harry Shum,et al.  Lazy snapping , 2004, ACM Trans. Graph..

[14]  Jitendra Malik,et al.  Contour and Texture Analysis for Image Segmentation , 2001, International Journal of Computer Vision.

[15]  R. Zabih,et al.  What energy functions can be minimized via graph cuts , 2004 .

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

[17]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Sudeep Sarkar,et al.  Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

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

[20]  P. Lions,et al.  Image recovery via total variation minimization and related problems , 1997 .

[21]  Laurent Najman,et al.  Geodesic Saliency of Watershed Contours and Hierarchical Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  R. Kimmel,et al.  Geodesic Active Contours , 1995, Proceedings of IEEE International Conference on Computer Vision.

[23]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

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

[26]  Azriel Rosenfeld,et al.  On connectivity properties of grayscale pictures , 1981, Pattern Recognit..

[27]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.