2Li H L, Ngan K N. Automatic video segmentation and tracking for content-based applications [J]. IEEE Communications Maga- zine, 2007,45 (1): 27-33.
3Shi J, Malik J. Normalized cut and image segmentation [J]. IEEETransactions on Pattern Analysis and Machine Intelligence, 2000,22 (8): 888-905.
4Martinez A M. On combining graph-partitioning with non-para- metric clustering for image segmentation [J]. Computer Vision and Image Uderstanding, 2004,95 (1): 72-85.
5Kolmogorov V, Vicent S. Graph cut based image segr0entation with connectivity priors [J]. IEEE Conference On Computer Vision and PattemRecognition, 2008,12 (1): 767-774.
6Ford L, Fulkerson D. Flows in Networks [M]. Princeton: Princeton University Press, 2010.
7Goldberg A, Tarjan R. A new approach to the maximum-flow problem [J]. Journal of the Association for Computing Machinery,1988,35 (4): 921-940.
8Bleyer M, Gelautz M. Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions [J]. Signal Proeessing: Image Communication, 2007,22 (2): 127-143.
9Ford L R, Fulkerson D R. Maximal flow through a network[M] // Gessel I, Rota G C. Classic Papers in Combinatories. Cambridge, MA: BirkhauserBoston Inc, 1987: 243-248.
10Dine E A. Algorithm for solution of a problem of maximum flow in networks with power estimation [J]. Soviet Mathematics Dok- lady, 1970,11: 1277-1280.
