搜索资源列表
MyGrabCut
- GrabCut 迭代图割算法实现：其中只有部分k—means算法和maxflow算法调用opencv库，其程序可以随意更改，测试算法时间，做改进算法练习-GrabCut iterative graph cut algorithm: where only part of the k-means algorithm and maxflow algorithm calls opencv library, the program can change, time to test the algorith
maxflow
- 最大流 最小割 是图割理论的重要部分，能用于双目立体视觉的立体匹配当中。-Max-flow is the important part of graph-cut theory,it also used to the stereo matching.
dinic
- dinic : an algorithm for the maxflow of the network
maxflow.cpp
- 最大最小流算法模板，可以在多种应用型状况下使用，特别是图像处理领域，达到分离前景后景的作用-Max-Min-Flow algorithm
maxflow-v2.22.src
- 由最大流最小割算法，求图的最大流。基于论文 “An Experimental Comparison of Min-Cut/Max-Flow Algorithms”-The maximum flow minimum cut algorithm, seeking maximum flow chart. Paper-based An Experimental Comparison of Min-Cut/Max-Flow Algorithms
LSA_TR_v2.02
- 基于图割方法的图像分割，是一种重要的图像分割个方法。文章是一篇发表在CVPR2014上的文章。-The LSA_TR library is a general optimization algorithm for arbitrary binary pairwise energies. It implements the LSA-TR algorithm. The library includes matlab files along with C++ code for maxflow/mincu
maxFlow
- 该算法是求无向图的最大流问题。用的是Ford-Fulkerson的算法。源程序中有两个版本。每个都可以运行。-The algorithm is not seeking the maximum flow problem to graph. Use the Ford-Fulkerson algorithm. There are two versions of the source code. Each can run.
maxflow
- 最大流分割程序，利用最大流最小割定理进行图像分割的matlab源码-Maximum flow segmentation program, using the maximum flow minimum cut theorem for image segmentation matlab source
maxflow-v3.04.src
- 图割法程序，min-cut/max-flow实现图像的分割-Graph cut method procedures, min-cut/max-flow of image segmentation
maxflow
- 计算网络最大流的代码，c++语言编写，可以使用。-the code is for calculating the max-flow of a network.
MaxFlow
- c++求解最大流问题，用加权矩阵输入通信网络，输出每次迭代过程中的最大流量及各路径分配的流量。- U7528 u52A0 u6743 u77E u9635 u8F93 u5165 u901A u4FE1 u7F51 u7EDC uFF0C u8F93 u51FA u6BCF u6B21 u8FED u4F3 u8FC7 u7A0B u4E2D u7684 u6700 u5927 u6D41 U91CF u53CA u5404 u8DEF
maxflow-v3.04.src
- 使用能量最小法中的图割法，解决图像分类问题，最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification)