Abstract Aiming at graph cuts majoring in interactive image segmentation, an automatic image segmentation method based on graph cuts is proposed. It can be used in both segmenting color images and segmenting gray images. In this method, the data item and the smooth item of the energy function are established after initialization. The energy function is solved by graph cuts. The series of steps are implemented iteratively until certain condition is met. The method does not need to make any constraints, build image model or estimate data distribution. It obtains good segmentation result rapidly. Gray images and color images are segmented by experiments. The experimental results show that the proposed approach is favorable.
[1] Boykov Y, Jolly M P. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images // Proc of the IEEE International Conference on Computer Vision. Vancouver, Canada, 2001: 105-112 [2] Rother C, Kolmogorov V, Blake A. GrabCut: Interactive Foreground Extraction Using Iterated Graph Cuts. ACM Trans on Graphics, 2004, 23(3): 309-314 [3] Sumengen B, Manjunath B S. Graph Partitioning Active Contours (GPAC) for Image Segmentation. IEEE Trans on Pattern Analysis and Machine Intelligence, 2006, 28(4): 509-521 [4] Greig D M, Porteous B T, Seheult A H. Exact Maximum a Posteriori Estimation for Binary Images. Journal of the Royal Statistical Society: Series B, 1989, 51(2): 271-279 [5] Ford L R, Fulkerson D R. Maximal Flow through a Network. Canadian Journal of Mathematics, 1956, 8(3): 399-404 [6] Comaniciu D, Meer P. Mean Shift: A Robust Approach toward Feature Space Analysis. IEEE Trans on Pattern Analysis and Machine Intelligence, 2002, 24(5): 603-619 [7] Kolmogorov V, Zabih R. What Energy Functions Can Be Minimized via Graph Cuts? IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26(2): 147-159 [8] Boykov Y, Kolmogorov V. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26(9): 1124-1137 [9] Boykov Y, Veksler O, Zabih R. Fast Efficient Approximate Energy Minimization via Graph Cuts. IEEE Trans on Pattern Analysis and Machine Intelligence, 2001, 23(11): 1222-1239 [10] Cherkassky B V, Goldberg A V. On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica, 1997, 19(4): 390–410
2011, Vol. 24 
