REGION MERGING VIA GRAPH-CUTS

In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of low boundaries. Our segmentation process merges regions of the watershed over-segmentation by minimizing a specific criterion using graph-cuts optimization. Two methods will be introduced in this paper. The first is based on regions histogram and dissimilarity measures between adjacent regions. The second method deals with efficient approximation of minimal surfaces and geodesics. Experimental results show that these techniques can efficiently be used for large images segmentation when a pre-computed low level segmentation is available. We will present these methods in the context of interactive medical image segmentation.

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

[2]  S. Beucher,et al.  Morphological segmentation , 1990, J. Vis. Commun. Image Represent..

[3]  Jian Sun,et al.  Lazy snapping , 2004, SIGGRAPH 2004.

[4]  David R. Bull,et al.  Combined morphological-spectral unsupervised image segmentation , 2005, IEEE Transactions on Image Processing.

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

[6]  Leo Grady,et al.  A multilevel banded graph cuts method for fast image segmentation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

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

[8]  Marisa E. Campbell,et al.  SIGGRAPH 2004 , 2004, INTR.

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

[10]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[11]  S. Beucher.  Use of watersheds in contour detection , 1979 .

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

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

[14]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[16]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[17]  Serge Beucher,et al.  Watershed, Hierarchical Segmentation and Waterfall Algorithm , 1994, ISMM.