Description: Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
To Search:
File list (Check if you may need any files):
最大流最小割\1.jpg
............\2.jpg
............\max_liu_min_segment.m
............\说明.txt
最大流最小割
Download