Location:
Search - edge flow
Search list
Description: 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。
带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. First is the method of sources and sinks so enumerated, after the enumeration of each, two sources and sinks to remove all remaining vertices as capacity constraints to a point, seeking the largest network flow, this is the apex of connectivity, followed by enumeration of all points of connectivity for the smallest of the plan as connectivity. Vertex capacity constraints with the biggest flow method : with the capacity constraints of the vertex is split into two u u and u *, the original entry point u u edge of the income side, the original point out u * u edge of the edge out after the u and u * a two-way link between the edge, while the capacity for the top point of the capacity constraints.
Platform: |
Size: 1515 |
Author: 吴地瓜 |
Hits:
Description: 一种基于 Edge Flow算法 的边缘检测程序
matlab实现
在彩图和灰度图纹理分割方面有很好的效果-based Edge Flow edge detection algorithm to achieve the procedures Matlab the gray level and color pictures texture segmentation as a very good effect
Platform: |
Size: 13914 |
Author: 照亮 |
Hits:
Description: 图像边缘提取边缘流方法的代码-Image Edge Extraction edge of the flow code
Platform: |
Size: 719896 |
Author: 林兰 |
Hits:
Description: 图像边缘提取边缘流方法的代码-Image Edge Extraction edge of the flow code
Platform: |
Size: 719872 |
Author: 林兰 |
Hits:
Description: 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。
带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. First is the method of sources and sinks so enumerated, after the enumeration of each, two sources and sinks to remove all remaining vertices as capacity constraints to a point, seeking the largest network flow, this is the apex of connectivity, followed by enumeration of all points of connectivity for the smallest of the plan as connectivity. Vertex capacity constraints with the biggest flow method : with the capacity constraints of the vertex is split into two u u and u*, the original entry point u u edge of the income side, the original point out u* u edge of the edge out after the u and u* a two-way link between the edge, while the capacity for the top point of the capacity constraints.
Platform: |
Size: 1024 |
Author: 吴地瓜 |
Hits:
Description: 一种基于 Edge Flow算法 的边缘检测程序
matlab实现
在彩图和灰度图纹理分割方面有很好的效果-based Edge Flow edge detection algorithm to achieve the procedures Matlab the gray level and color pictures texture segmentation as a very good effect
Platform: |
Size: 13312 |
Author: 照亮 |
Hits:
Description: Active contour models, deformable surface models,
edge detection, gradient vector flow, image segmentation,
shape representation and recovery, snakes.-Active contour models, deformable surface models, edge detection, gradient vector flow, image segmentation, shape representation and recovery, snakes.
Platform: |
Size: 401408 |
Author: 李尊 |
Hits:
Description: Edmonds-karp algorithm - A C++ program which returns the largest flow and flow through each edge.-Edmonds-karp algorithm- A C++ program which returns the largest flow and flow through each edge.
Platform: |
Size: 1024 |
Author: piyu |
Hits:
Description: 完成光流法算法。用于图像边缘的提取，运动目标的检测。-Optical flow algorithm to complete. For image edge extraction, the detection of moving targets.
Platform: |
Size: 2048 |
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: 改进VOD视频点播系统的流调度算法，能更有效地利用边缘网的带宽，提高用户接收视频的速度、清晰度等-VOD video on demand system to improve the flow scheduling algorithm can be more efficient use of the edge of network bandwidth, improve user to receive video speed, clarity, etc.
Platform: |
Size: 1024 |
Author: 阿斯兰 |
Hits:
Description: TrackIT是一款开放式的机器视觉开发平台，目前集成了从相机输入、色彩转换、彩色图像处理、灰度图像处理、二值图像处理、阈值分割、边缘检测、Blob检测、相机标定、Kalman滤波器、光流跟踪器、最近邻域跟踪、数学形态学方法、机器学习算法等近100个组件，并在不断添加更新中，采用开源OpenCV、WxWidgets、CMU139等标准工具，使用XML动态解析界面，所有参数在界面上直接调整，同时可立即看到调整效果，并可动态加载组件，可用于一般科学研究和机器视觉系统开发。运行时需要.net框架支持。-TrackIT is an open development platform for machine vision, now integrated input from a camera, color conversion, color image processing, gray-scale image processing, binary image processing, threshold segmentation, edge detection, Blob detection, camera calibration, Kalman filter, optical flow tracker, nearest neighbor tracking, mathematical morphology, machine learning algorithms nearly 100 components, and continually add updates, using open source OpenCV, WxWidgets, CMU139 and other standard tools, using XML dynamically analysis interface, all parameters in the interface directly on the adjustment, while adjustments immediately see results, and can dynamically load the components, can be used for general scientific research and machine vision system development. Run-time needs. Net framework support.
Platform: |
Size: 28174336 |
Author: 黄设 |
Hits:
Description: 用边缘流的方法进行的图像分割的具体推导过程，包括图像和实验结果。-Edge flow method using image segmentation specific derivation process, including images and experimental results.
Platform: |
Size: 3030016 |
Author: 吴会英 |
Hits:
Description: 这是一个帧同步数据搜索模块，用于检测输入的数据流中的帧头，当检测到帧头后输出一个同步信号。
输入数据为 8bit的并行数据流，数据流中的每帧由 10 个字节组成，为 1个字
节的帧头（47H）加上 9 个字节的数据。各个字节的中间部分与时钟上升沿对齐。
每帧数据中，除帧头外的其他数据也可能为 47H。
在数据传输过程中，帧头数据有可能受到干扰而变为其他数值，因此要求输出同步信号时具有一定的容错功能。-This is a frame synchronization data search module, for detecting the input data stream in the frame header, when the detected frame header and a synchronization signal after the output. 8bit parallel input data for the data flow, data flow in each frame consists of 10 bytes for a byte frame header (47H) plus 9 bytes of data. The middle part of each byte alignment with the clock rising edge. Each frame of data, in addition to other data outside the frame header may 47H. In the data transmission process, the frame header data may be subject to interference into other values, thus requiring the output sync signal has certain fault tolerance.
Platform: |
Size: 409600 |
Author: 追月 |
Hits:
Description: 基于光流法的运动目标检测
也可用于流体力学运动检测-Optical flow method based on the motion detection Motion detection can also be used for fluid dynamics
Platform: |
Size: 1396736 |
Author: mapeng |
Hits:
Description: 方向流，用于准确定位图像边缘的方向，很实用哟-The direction of flow for accurate positioning of the image edge direction, it is practical yo
Platform: |
Size: 3118080 |
Author: zhangwenge |
Hits:
Description: edge_detect.m : 图像边缘检测
其中使用
梯度算子边缘检测 : roberts算子、prewitt算子、Sobel算子、Canny算子
二阶微分算子法 : 拉普拉斯高斯算子、canny算子
lenna.bmp : 原始灰度图片
实验结果文件夹 ： 保存了实验过程中生成的图像和程序流程图-edge_detect.m: edge detection which uses the gradient operator edge detection: roberts operator, prewitt operator, Sobel operator, Canny operator second-order differential operator method: Laplacian Gaussian operator, canny operator lenna . bmp: original gray image results folder: Save the images generated during the experiment and the program flow chart
Platform: |
Size: 389120 |
Author: 许胜强 |
Hits:
Description: 求解过程中，由于几何模型发生变化而导致区域网格改变时会出现几何结构的连续性问题。本章中，我们举两个例子——流道中由于不同尺寸孔板引起额外压力损失问题是稳态几何连续性的一个例子。从概念来看，这个问题与第5章贝纳尔问题中通过Rayleigh数进行的变量连续性没什么不同。第二个例子是液体中悬浮的乳胶颗粒的干膜。在这个问题中，考虑了两个移动前缘；一个通过坐标变换，另一个通过光滑界面模型。该技术对于之前模拟该问题采用的移动弱项方法有所改进。-Solving process, due to geometry changes and the continuity of the geometric structure of the regional grid changes. In this chapter, we give two examples- the flow channel due to the different size orifice caused by the additional pressure loss is an example of the steady-state geometric continuity. Variable continuity standpoint, this issue in Chapter 5 Bernal Rayleigh number is no different. The second example is a dry film of the latex particles suspended in the liquid. In this problem, consider the two move the leading edge a coordinate transformation, and the other by the smooth interface model. The technology used before to simulate the mobile weaknesses improvements.
Platform: |
Size: 5903360 |
Author: cichin |
Hits:
Description: 图像分割算法，比较详细的水平集算法和边缘流算法文章，值得一看。-Image segmentation algorithm, more detailed level set algorithm and edge flow algorithm this paper, it is worth a look
Platform: |
Size: 12023808 |
Author: fanyanjun |
Hits:
Description: 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.
Platform: |
Size: 1024 |
Author: 刘适 |
Hits: