这个c程序实现几种2D和3D分割算法，这些算法可以参考下面这篇论文，程序的运行请查看README.txt-Camille Couprie, Leo Grady, Laurent Najman and Hugues Talbot , "Power Watersheds: A New Image Segmentation Framework Extending Graph Cuts, Random Walker and Optimal Spanning Forest", ICCV 09, 2009

五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi

马尔可夫随机场的图像分割，本人整理的代码和论文-Markov random field image segmentation, I am finishing the code and papers

下面这个论文描述的分割算法的实现： Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb and Daniel P. Huttenlocher International Journal of Computer Vision, 59(2) September 2004. 这个程序使用彩色图像（PPM格式）并为产生的分割结果的每个区域随机分配颜色。-Implementation of the seg