当前位置：
首页 资源下载
搜索资源 - graph search matlab
搜索资源列表
-
0下载：
提出一种带边界匹配的基于 Graph Cut 的快速纹理合成算法.通过将纹理样本以不同的位移贴到输出图中完成合成 ,重叠区域的像素取值由 Graph Cut 确定.引入边界图辅助位移搜索 ,以增强合成结果的边界连续性 在预处理过程中计算 2 个相同样本在所有相对位移下的匹配误差 ,选取一部分误差最小的位移组成 “优选位移” 集合 ,合成过程中的块间相对位移仅从此集合中选取 ,大大地提高了合成速度.-This paper proposes an efficient method for tex
-
-
0下载：
Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted
graph. It is simple in every respect. It has a short and compact descr iption, is easy to implement, and
has a surprisingly simple proof of correctness.
-
-
1下载：
visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code
-
-
5下载：
蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
-
-
0下载：
此源码是基于matlab编写的关于查找图像中图形的个数，及查找每个图形的重心并显示。-This source code is written in matlab based on the number of graphic image search, and find the center of each graph and display.
-
-
0下载：
为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and
-
-
3下载：
图论中经常用到的深度优先搜索法 经常用在电力系统的可靠性的解列运算当中-Depth-first search method often used in graph theory is often used in the reliability of the power system splitting operator which
-
-
0下载：
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.
This algorithm is a member of the a
-
