搜索资源列表
blobrw
- 微软的SQL SERVER数据库的Image、text等字段都属于二进制的大对象。这些对象的存取和其他轻型对象略有不同。 微软.NET Framework的System.IO命名空间下给我们提供了一个FileStream文件流类。我们可以使用这个文件流对二进制大对象轻松进行读写。 我实现了一个简单的WinForm程序，这个程序通过点击“Open”按钮选择一个bmp或者jpg文件，并显示在图形控件PictureBox中。通过“Save”按钮存入数据库。点击“View”CheckBo
MaxStream
- 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
介绍了图割的基本思想
- 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
opendpi-netfilter-libpcap-1.2 OpenDPI作为DPI分析工具
- OpenDPI作为DPI分析工具，与netfilter结合在上层可用libpacp截包，然后进行流量的获取与分析，然后进行流量控制-OpenDPI as DPI analysis tools, combined with the netfilter libpacp available in the upper cut-off package, and then access and analysis of flow, then flow control
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
A-Fusing-Color-and-Gradient-Features-Approach-to-R
- 本文通过融合图像的颜色和梯度特征 ,实现了一种实时背景减除方法。首先融合颜色和梯度特征建立新的能量函数 然后基于图切割算法最小化能量函数 ,并对前景P 背景进行分割 最后使用光流验证前景区域的真实性 ,并更新背景模型。- Based on the fusion of color and gradient features , this paper implement s a novel approach to real-time background subtraction.Firstly ,
Simple_MinCut
- 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 descr iption, is easy to implement, and has a surprisingly simple proof of correctness.
Maxiflowminicut
- 最大流和最小截算法，在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-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 fr
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
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（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, isoperi
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
regionpushrelabel-v1.01
- 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 th
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成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
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
Graph-theory-algorithm-set
- 对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 m
dinic_l
- 主要实现图片的打开，并用最大流最小割定理实现图片的切割-Picture open, and the maximum flow minimum cut theorem of pictures cut
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
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
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.)