Location:
Search - flow and cut
Search list
Description: 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
Platform: |
Size: 2026093 |
Author: 水中雁 |
Hits:
Description: 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
Platform: |
Size: 3965952 |
Author: 水中雁 |
Hits:
Description: 医学图象分割软件,使用了基于Min-Cut/Max-Flow开元方程库(可在http://www.adastral.ucl.ac.uk/~vladkolm/software.html下载最新版本) 做分割判断, 并使用cimg库读取dcm图片. 本部分源码只负责切出轮廓, 轮廓将在openGL端中输出. -Medical image segmentation software, the use of equations based on the Kaiyuan Min-Cut/Max-Flow library (available at http://www.adastral.ucl.ac.uk/ ~ vladkolm/software.html download the latest version) to do partition to judge, and use the library to read CIMG DCM picture. The source code is only responsible for part of the contour cut, contour in openGL output side.
Platform: |
Size: 166912 |
Author: zhou |
Hits:
Description: 上传几个代码，这个是最大流和最小截算法，现在在建模，要下载一些算法，希望能通过站长的审核-From a number of code, this is the maximum flow and minimum cut-off algorithm, now in the modeling, it is necessary to download a number of algorithms, regulators hope to audit
Platform: |
Size: 1024 |
Author: f |
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: 本文通过融合图像的颜色和梯度特征 ,实现了一种实时背景减除方法。首先融合颜色和梯度特征建立新的能量函数 然后基于图切割算法最小化能量函数 ,并对前景P 背景进行分割 最后使用光流验证前景区域的真实性 ,并更新背景模型。- Based on the fusion of color and gradient features , this paper implement s a novel approach to real-time background subtraction.Firstly , an energy function is defined based on the fusion of color and gradient features. Secondly , the graph cut s based algorithm is employed to minimize energy function and segment the foreground. Finally , average optical flow is used to make inference about the validity of foreground regions , background models are then updated.
Platform: |
Size: 787456 |
Author: 巡洋舰 |
Hits:
Description: Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted
graph. It is simple in every respect. It has a short and compact description, is easy to implement, and
has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm
known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the
algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about uVu nearly
identical phases each of which is a maximum adjacency search.
Platform: |
Size: 2048 |
Author: Daniel |
Hits:
Description: 最大流和最小截算法，在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-Maximum flow and minimum cut algorithms, in this function exists in the preparation of a detail, if any label does not take a check point has been, I get the most front point. If the statement is added to randomly selected for each run the program may come up with different results of maximum flow.
Platform: |
Size: 1024 |
Author: Taro Yu |
Hits:
Description: 实现了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 Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov] in the new maximum flow algorithm, after experimental verification than the traditional maximum flow algorithm more efficient
Platform: |
Size: 1024 |
Author: ray |
Hits:
Description: 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
Platform: |
Size: 1033216 |
Author: 黄鹏 |
Hits:
Description: 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker.
Platform: |
Size: 7720960 |
Author: zc |
Hits:
Description: 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
Platform: |
Size: 508928 |
Author: 珞珞 |
Hits:
Description: graphcut应用 Global optimisation via s-t graph cuts is widely used in
computer vision and graphics. To obtain high-resolution
output, graph cut methods must construct massive N-D
grid-graphs containing billions of vertices. We show that
when these graphs do not fit into physical memory, current
max-flow/min-cut algorithms—-A Scalable Graph-Cut Algorithm for N-D Grids
Platform: |
Size: 26624 |
Author: hahaha |
Hits:
Description: 最大流最小割
可以测试某一个特定的图
也可以随机生成n个顶点的图和k条边
用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
Platform: |
Size: 964608 |
Author: su |
Hits:
Description: 适用于大型网格图的最大流最小割算法，适合初学者-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 than available memory. Besides nearest-neighbour graphs, the library also supports more complex regular structures to speed up things like QPBO, cell complexes, and Ishikawa-like constructions. The public implementation was developed by Sameh Khamis who is now at the University of Maryland.
Platform: |
Size: 27648 |
Author: liuwei |
Hits:
Description: 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate.
Platform: |
Size: 55296 |
Author: 中士 |
Hits:
Description: 主要实现图片的打开，并用最大流最小割定理实现图片的切割-Picture open, and the maximum flow minimum cut theorem of pictures cut
Platform: |
Size: 698368 |
Author: tianqing |
Hits:
Description: Network information theory aims to establish the fundamental limits on information flow
in networks and the optimal coding schemes that achieve these limits. It extends Shannon’s
fundamental theorems on point-to-point communication and the Ford–Fulkerson
max-flow min-cut theoremfor graphical unicast networks to general networks withmultiple
sources and destinations and shared resources. Although the theory is far fromcomplete,
many elegant results and techniques have been developed over the past forty years
with potential applications in real-world networks. This book presents these results in a
coherent and simplified manner that should make the subject accessible to graduate students
and researchers in electrical engineering, computer science, statistics, and related
fields, as well as to researchers and practitioners in industry.
Platform: |
Size: 3757056 |
Author: zaman |
Hits:
Description: 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
Platform: |
Size: 149504 |
Author: renmeimei |
Hits:
Description: 利用最大流最小割的原理，实现了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.)
Platform: |
Size: 787456 |
Author: 小豆豆43328
|
Hits: