说明:分水岭算法后,会出现过分割现象,这就需要进行区域合并,而进行区域合并前很重要的事计算RAG(区域连接图),区域邻接图的合并规则,在进行区域合并时可以使用,希望对大家有用-region merging for region adjecent gragh,might it be help for you...
说明:图割法进行图像处理的MATLAB程序,如果要用于其他的算法添加一些代码就好了。
说明:可求最短路径和最小边覆盖颠覆盖和旅行商问题的图论程序,用matlab编写-Rectifiable shortest path and minimum edge covering and traveling salesman problem of subversion to build the gra...
说明: In addition, we include the following well-known methods as baselines: spectral matching (SM) [3], spectral matching with affine constrai...
说明:image segmentation based on max-min flow based on graph theory.
说明:用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵-Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph ...
说明:蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。