[2] [2] OTSU N.A threshold selection method from gray-level histograms [J］.IEEE Transactions on Systems, Man, and Cybernetics, 1979, 9(1):62-66.

[4] [4] VON LUXBURG U.Tutorial:a tutorial on spectral clustering [J］.Statistics and Computing, 2007, 17(4):395-416.

[5] [5] YUH-TAY L.A contour tracing algorithm that preserves common boundaries between regions [J］.CVGIP Image Understanding, 1991, 53(3):313-321.

[7] [7] NOCK R, NIELSEN F.Statistical region merging [J］.IEEE Transaction on Pattern Analysis and Machine Intelligen-ce, 2004, 26(11):1452-1458.

[9] [9] OSHER S, SETHIAN J A.Fronts propagating with curvature dependent speed:algorithms based on Hamilton-Jacobi formulations [J］.Journal of Computational Phy-sics, 1988, 79(1):12-49.

[10] [10] OSHER S, PARAGIOS N.Geometric level set methods in imaging vision and graphics [M］.Berlin:Springer-Verlag, 2003.

[13] [13] BOYKOV Y, VEKSLER O, ZABIH R.Fast approximate energy minimization via graph cuts[J］.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(11):1222-1239.

[14] [14] BOYKOV Y, KOLMOGOROV V.An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision[J］.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(9):1124-1137.

[15] [15] BOYKOV Y, FUNKA-LEA G.Graph cuts and efficient N-D image segmentation[J］.International Journal of Computer Vision, 2006, 70(2):109-131.

[16] [16] GRADY L.Random walks for image segmentation[J］.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(11):1768-1783.

[17] [17] ROTHER C, KOLMOGOROV V, BLAKE A.“GrabCut”-interactive foreground extraction using iterated graph cuts [J］.ACM Transactions on Graphics, 2004, 23(3):309-314.

[18] [18] FELZENSZWALB P, HUTTENLOCHER D.Efficient graph-based image segmentation [J］.International Journal of Computer Vision, 2004, 59(2): 11-33.

[19] [19] WASSENBERG J.Efficient algorithms for large-scale image analysis[M］.Karlsruher:KIT Scientific Publishing, 2014.