Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures Platform: |
Size: 47104 |
Author:yangfei |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program Platform: |
Size: 5120 |
Author:任龙 |
Hits:
Description: matlab图像处理，进行左右两图的匹配，有图像载入界面，匹配实现方便-matlab image processing, for about two graph matching, has image loading interface, matching the achievement of convenience Platform: |
Size: 196608 |
Author:eccbbc |
Hits:
Description: 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm description completely according to the use of computing to achieve a collection of matlab code. Here we need to discuss is the way to broaden the selection of the algorithm, a lot of friends who wish to discussions in order to find a better way to broaden the way, there is a certain mind to tell me, thank you, jxrhhu@hhu.edu.cn Platform: |
Size: 1024 |
Author:jiangxr |
Hits:
Description: 与grabcut算法配套的论文，详述了对graphcut算法改进的地方，及其优点，-Matching algorithm with grabcut paper detailing the algorithm graphcut improved, and its advantages, Platform: |
Size: 387072 |
Author:芳芳 |
Hits:
Description: 用matlab实现单双枝节阻抗匹配，并用smith圆图匹配演示过程-Using matlab to achieve single-and double-side impedance matching, and demonstrate smith circle graph matching process Platform: |
Size: 43008 |
Author:张飞 |
Hits:
Description: 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph theory is a very important content. The information presented in graph theory the most short-circuit algorithm, matching, and saleman & postman problem, minimum spanning tree, network flow problem, such as the classic. Has a very classic and easy-to-understand Matlab programme . Platform: |
Size: 231424 |
Author:qiu |
Hits:
Description: Graph Matching Toolbox in Matlab
tested on Matlab 7.4 (windows/mac/unix)
fixed a bug which affected discretization performance in the case of different graph sizes Platform: |
Size: 382976 |
Author:黄晓华 |
Hits:
Description: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6. Platform: |
Size: 47104 |
Author:肖翔 |
Hits:
Description: 本文将排课五要素绑定、封装成课元、课栈两个向量，并以二维权值矩阵描述课元
和课栈之间的关联系。
提出了最佳匹配和遗传算法的排课算法，以随机生成的二维数字矩阵来反映课元和
课栈的关联权重，对数字矩阵组处理和最佳匹配得到的匹配偶图组为遗传算法的初始种
群，以排课各种原则的加权和为目标函数，在遗传算子控制下迭代来寻求更优的匹配结
果即使目标函数最小的偶图匹配结构，进而得到满意的排课结果。
提出了关联匹配和禁忌搜索的排课算法，以随机二维数字矩阵描述课元和课栈之问
的关联权重，按照重权优先并根据正确性原则进行约简，获得课元和课栈之间的匹配偶
图。在此基础上，引入禁忌搜索算法，以排课的完备性原则、合理性原则和人性化原则
的加权和为目标函数，以随机二维权值矩阵生成的匹配偶图为初始解，对二维权值矩阵
进行扰动构成搜索邻域，以生成的匹配偶图为禁忌对象，采用全局藐视准则，获得最优
的排课方案。
以Matlab为平台，利用Excd数据库和Mallab的互联实现数据交换，编写了两套
算法的应用程序，通过实例来验证两套排课算法，结果表明两套算法是可行的。-Arranging the five elements of this paper, binding, packaging into a class element, class stack of two vectors and matrices described by two classes per Rights
And the relationship between class stack link.
Offers the best match and Genetic Algorithm Platoon algorithm to randomly generated two-dimensional figures to reflect the class element and matrix
Class stack associated with weight, the digital matrix group received treatment and the best matching group bipartite graph matching the initial kind of genetic algorithm
Group to the weighted course arrangement of principles and the objective function, under the control of the genetic operator iteration to seek the better match Results
Results even if the objective function structure of the smallest bipartite graph matching, and then Timetabling satisfactory results.
Match the proposed association Timetabling algorithm and tabu search, a random two-dimensional digital matrix element and the class description class stack of Q Platform: |
Size: 1812480 |
Author:张林杰 |
Hits:
Description: 基于灰度的归一化匹配算法：将原图以及匹配图灰度化，算出相关系数后得到匹配区域。-Based on Gray' s normalized matching algorithms: the original image and the gray level of matching graph, calculate the correlation coefficient obtained after the matching area. Platform: |
Size: 49152 |
Author:frank |
Hits:
Description: 1.GeometricContext文件是完成图片中几何方向目标分类。
参考文献《Automatic Photo Pop-up》Hoiem 2005
2 GrabCut文件是完成图像中目标交互式分割
参考文献《“GrabCut” — Interactive Foreground Extraction using Iterated Graph Cuts》
C. Rother 2004
3 HOG文件是自己编写的根据HOG特征检测行人的matlab代码
4 虹膜识别程序是下载的一个通用的虹膜识别程序，可以运行
5 GML_AdaBoost_Matlab_Toolbox是一个很好用的adaboost matlab工具箱
6 libsvm-mat-2.91-1 是用C编写的改进的SVM程序，代码质量很高，提供了matlab接口
7 SIFT_Matlab 是编写的利用sift特征进行的宽基线匹配，代码质量高
8 FLDfisher 是利用fisher 线性降维方法进行人脸识别-1.GeometricContext file is complete the picture in the geometric direction of target classification. References " Automatic Photo Pop-up" Hoiem 2005 2 GrabCut the target file is an interactive segmentation of image reference " " GrabCut " - Interactive Foreground Extraction using Iterated Graph Cuts" C. Rother 2004 3 HOG documents prepared under their own HOG Characteristics of pedestrian detection matlab code 4 iris recognition process is to download a general iris recognition program, you can run 5 GML_AdaBoost_Matlab_Toolbox is a good use of adaboost matlab toolbox 6 libsvm-mat-2.91-1 is written in C to improve the SVM procedures, code of high quality, provides a matlab interface to 7 SIFT_Matlab is prepared for the use of sift features a wide baseline matching, the code is the use of high quality 8 FLDfisher fisher linear dimension reduction method for face recognition Platform: |
Size: 6918144 |
Author:张数 |
Hits:
Description: 图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal，最大匹配的匈牙利算法，并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab program to realize.
Platform: |
Size: 47104 |
Author:张青 |
Hits:
Description: 图论算法及MATLAB程序代码,包含算法pdf文档和M文件。Warshall-Floyad算法，Kruskal避圈法，匈牙利算法，可行点标记求最佳匹配算法，Ford--Fulkerson标号法求最大流算法，最小费用最大流算法。求解数学模型必备！-Graph theory algorithms and MATLAB code contains of algorithm pdf documents and M files. The the Warshall-Floyad algorithm, Kruskal avoid lap law, Hungary algorithm feasible point mark for the best matching algorithm, Ford- Fulkerson labeling method for maximum flow algorithm, minimum cost maximum flow algorithm. To solve the mathematical model is essential! Platform: |
Size: 207872 |
Author:Binjie Liao |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm)) Platform: |
Size: 37888 |
Author:解码 |
Hits:
Search - graph matching matlab