Some links between min-cuts, optimal spanning forests and watersheds

Di erent optimal structures: minimum cuts, minimum spanning forests and shortest-path forests, have been used as the basis for powerful image segmentation procedures. The well-known notion of watershed also falls into this category. In this paper, we present some new results about the links which exist between these di erent approaches. Especially, we show that min-cuts coincide with watersheds for some particular weight functions.

[1]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[2]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[3]  Roberto de Alencar Lotufo,et al.  Watershed by image foresting transform, tie-zone, and theoretical relationships with other watershed definitions , 2007, ISMM.

[4]  Fernand Meyer,et al.  Minimum Spanning Forests for Morphological Segmentation , 1994, ISMM.

[5]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004 .

[6]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Gilles Bertrand,et al.  Enhanced computation method of topological smoothing on shared memory parallel machines , 2005, Journal of Mathematical Imaging and Vision.

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

[9]  Jayaram K. Udupa,et al.  Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[12]  Roberto de Alencar Lotufo,et al.  Duality between the Watershed by Image Foresting Transform and the Fuzzy Connectedness Segmentation Approaches , 2006, 2006 19th Brazilian Symposium on Computer Graphics and Image Processing.

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Jayaram K. Udupa,et al.  Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image Segmentation , 2001, Comput. Vis. Image Underst..

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[16]  Serge Beucher,et al.  Use of watersheds in contour detection , 1979 .

[17]  Alexandre X. Falcão,et al.  The Ordered Queue and the Optimality of the Watershed Approaches , 2000, ISMM.

[18]  Gilles Bertrand,et al.  Watershed cuts , 2007, ISMM.

[19]  VekslerOlga,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001 .