强力分水岭，一种融合图割，随机游走，最小路径的基于图论的分割算法-Strong watershed, a fusion graph cuts, random walks, the minimum path segmentation algorithm based on graph theory

图4.7给出了V=4，相位集合的相位数分别为P=1、2、4、8时的随机分割的PTS-OFDM系统的CCDF的性能图。仿真参数：分割方法为随机分割，子载波数N=128，子载波数据采用QPSK调制，仿真的OFDM符号数为1000个。-Figure 4.7 shows the V = 4, the phase of the collection phase, respectively P = 1,2,4,8 were separated when the PTS-OFDM system perform

The random walker algorithm was introduced in the paper: Leo Grady and Gareth Funka-Lea, "Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials", in Proceedings of the 8th ECCV04, Workshop on Compute