Location:
Search - maxflow
Search list
Description: 用maxflow算法实现图像的切割，需要事先设置source种子和sink种子
Platform: |
Size: 15491 |
Author: AwAy |
Hits:
Description: 三维立体视觉匹配源码
Tested under windows, Visual C++ 6.0 compiler and unix (SunOS 5.8 and RedHat Linux 7.0, GNU c++ compiler). -3D visual matching source Tested under windows. Visual C++ 6.0 compiler and unix (SunOS 5.8 and Red Hat Linux 7.0, GNU compiler c).
Platform: |
Size: 13312 |
Author: 周攀 |
Hits:
Description: graphcut分割法，针对彩色图象进行分割，里面包含了maxflow的算法实现。-graphcut segmentation method for color image segmentation, which includes maxflow algorithm.
Platform: |
Size: 34816 |
Author: 刘惠 |
Hits:
Description: 最大流最小割算法的经典实现，对于图像处理的初学者很有帮助。内附说明文档。-Maximum flow minimum cut algorithm to achieve the classic, for image processing useful beginners. Attached documentation.
Platform: |
Size: 22528 |
Author: 夏晓宁 |
Hits:
Description: 在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-In this function exists in the preparation of detail, when the term of office does not take a grade-point inspection, I get the most forward point. If added to randomly selected sentences, each running the program may be different from the results of maximum flow.
Platform: |
Size: 1024 |
Author: 刘东 |
Hits:
Description: 用maxflow算法实现图像的切割，需要事先设置source种子和sink种子-Algorithm using images maxflow cutting, the need for prior setup source of seeds and seed sink
Platform: |
Size: 15360 |
Author: AwAy |
Hits:
Description: max flow 求图的最大流算法 VC6.0-max flow chart for maximum flow algorithm VC6.0
Platform: |
Size: 30720 |
Author: 李佳 |
Hits:
Description: 最大流算法,当时学图论的时候写的C++程序,可以用于网络流计算.-Maximum flow algorithm, at the time when learning Graph Theory wrote C++ Procedures can be used for network flow calculation.
Platform: |
Size: 900096 |
Author: 李宝亮 |
Hits:
Description: 图论中的最大流matlab应用程序，非常好用！-Graph theory of maximum flow matlab application, very easy to use!
Platform: |
Size: 1024 |
Author: liu |
Hits:
Description: 最大流最小分割算法的实现。maxflow
-Maximum flow minimum partition algorithm. maxflow
Platform: |
Size: 15360 |
Author: herong |
Hits:
Description: 最大流详解，解释很全很清楚，为acm学习不可多得材料-maxflow
Platform: |
Size: 570368 |
Author: 刘先生 |
Hits:
Description: 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
Platform: |
Size: 13312 |
Author: 霓棠烟鱼 |
Hits:
Description: 微软研究院做的一个 集合了几种常见的立体匹配算法：包括sad,ssd,bp,maxflow等等。而且自带truth map可以评估自己的算法-Microsoft Research to do a collection of several common stereo matching algorithm: including the sad, ssd, bp, maxflow and so on. Truth map and can bring their own assessment of their own algorithm
Platform: |
Size: 179200 |
Author: woxiest |
Hits:
Description: Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5-Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5
Platform: |
Size: 1024 |
Author: Joao |
Hits:
Description: 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
Platform: |
Size: 61440 |
Author: jiangkaihua |
Hits:
Description: c/c++实现的max flow有效的算法-c/c++ to achieve max flow algorithm
Platform: |
Size: 1024 |
Author: 汪敏 |
Hits:
Description: maxflow算法c++代码,图像处理很有用-maxflow algorithm c++ code, image processing is useful
Platform: |
Size: 49152 |
Author: 严小刚 |
Hits:
Description: MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0- MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0
Platform: |
Size: 14336 |
Author: Alex |
Hits:
Description: 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision.
Yuri Boykov and Vladimir Kolmogorov.
In IEEE Transactions on Pattern Analysis and Machine Intelligence, September 2004.
Platform: |
Size: 13312 |
Author: illusionme |
Hits:
Description: maxflow-v3.04.src.zip
Platform: |
Size: 28672 |
Author: red_night_boy
|
Hits: