搜索资源列表
介绍了图割的基本思想
- 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-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
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
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-v2.21.src
- 最大流最小割算法的c++源代码,用于图像分割和处理领域-Minimum cut maximum flow algorithm c++ source code for image segmentation and processing
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.
ALE
- 图像分割算法，是基于最小切最大流算法的分割方法。-The image segmentation algorithm is a segmentation method based on the maximum flow minimum cut algorithm.
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
match-.src
- 使用最小割最大流实现图割的立体匹配算法，建立匹配能量函数，构造网格图并求得最小值，匹配效率高时间短，内附说明文档及分析用法。 -The use of the maximum flow minimum cut graph cut algorithm for stereo matching, matching of energy function, and obtain the minimum mesh structure, high efficiency, short time, contai
最大流最小割算法算理
- 这是对图割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.)