搜索资源列表
maxflow
- 最大流最小割算法，可以跟踪主动镜头下的非刚体目标！
介绍了图割的基本思想
- 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
3_MinCut.rar
- 一个经典的求解最大流最小割代码 VC++版本,A classical solution of maximum flow minimum cut code VC++ Version
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
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
graphcut
- 最大流最小割，用于图片分割以及与图片分割类似的网络问题-Maxflow/minium cut,used in graph cut or other similar problem
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
dijkstra
- 用于图像分割的dijkstra距离的计算，用于最大流最小割等算法-To dijkstra distance calculation used to image segmentation for the maximum flow minimum cut algorithm
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
gco-v3.0
- 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
active-graph-cuts
- 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard
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
最大流最小割算法算理
- 这是对图割graphcut的最大流最小割算法的讲解(This is the graph cut graphcut maximum flow minimum cut algorithm explained)
Graph_Cut (C++代码)
- 利用最大流最小割的原理，实现了graph cut对图像的分割，方法简单，易于理解(Using the principle of maximum flow minimum cut, graph cut can be used to segment images. The method is simple and easy to understand.)