搜索资源列表
介绍了图割的基本思想
- 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
PlanarCut-v1.0
- 快速图割算法，计算平面图的最大流最小割计算平面图的最大流最小割-The PlanarCut-v1.0 library computes max-flow/min-s-t-cut on planar graphs. It implements an efficient algorithm, which has almost linear running time. The library also provides for several easy-to-use interfaces in ord
stereomatchingaft
- 图割算法 求图像的立体匹配问题 最大流最小割问题-graphcut stereomatching matlabcode
maxflow-v3.0.src.tar
- 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
match-v3.3.src
- 实现图像的匹配，用最大流最小割的算法实现-match
newmaxflowaigorithm
- 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法，经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Mini
maxflow-v3.01.src.tar
- 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-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.
maxflow-v2.21.src
- 最大流最小割算法的c++源代码,用于图像分割和处理领域-Minimum cut maximum flow algorithm c++ source code for image segmentation and processing
maxflow
- 最大流最小割算法的实现,能量最小化算法做分割,恢复等-max flow/min cut
graphcut
- Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
dgc
- 动态的基于图模型的图像分割算法 ，利用最大流最小波-DYNNAMIC GRAPH CUTS- software for dynamically computing mincut/maxflow in a graph
regionpushrelabel-v1.01
- 适用于大型网格图的最大流最小割算法，适合初学者-The regionpushrelabel-v1.03 library computes max-flow/min-cut on huge N-dimensional grid-graphs in graphics, vision, and medical imaging. The C++ implementation is designed specifically for multi-core systems and graphs larger
The-minimumcostmaximumflow
- 关于图论中最小费用最大流的PPT介绍，解释很详尽，对于本题目的算法很有帮助-Graph theory about the minimum cost maximum flow PPT introduction, the explanation is very detailed, for ontology purpose algorithm is very helpful
ALE
- 图像分割算法，是基于最小切最大流算法的分割方法。-The image segmentation algorithm is a segmentation method based on the maximum flow minimum cut algorithm.
maxflow-v3.01
- kolmogorov最大流算法的实现，程序可调试，可用-the implement of maxflow
maxflow-of-bfs-and-dfs
- 分别利用广度和深度求最大流，是很好的学习最大流算法的代码，简单，实用-method maxflow
max-flow
- kolmogorov提出的最大流算法代码，可运行，里面有具体事例-Max flow
最大流最小割算法算理
- 这是对图割graphcut的最大流最小割算法的讲解(This is the graph cut graphcut maximum flow minimum cut algorithm explained)