Search - edge link

[Other resource] graphDegree

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:

[Multimedia program] CannyJava

Description: 图像边缘检测(Canny 算法)的Java实现 Canny边缘检测算法 step1:用高斯滤波器平滑图象； step2:用一阶偏导的有限差分来计算梯度的幅值和方向； step3:对梯度幅值进行非极大值抑制； step4:用双阈值算法检测和连接边缘 -Edge Detection (Canny algorithm) to the Java Canny edge detection algorithm ste p1 : Gaussian smoothing filter image; step2 : with a partial derivative of the finite difference to calculate the gradient amplitude and direction; step3 : gradient amplitude of the non-maximum inhibition; step4 : dual-threshold algorithm for edge detection and link
Platform: | Size: 58040 | Author: 常 | Hits:

[Other] pagerank

Description: 用于实现pagerank算法编程，只是一个算法，节点代表网页，边代表连接。-to achieve hl_end programming algorithm, only one algorithm, node representative website edge represents a link.
Platform: | Size: 1330 | Author: 范欣 | Hits:

[Data structs] graphDegree

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:

[Multimedia Develop] CannyJava

Description: 图像边缘检测(Canny 算法)的Java实现 Canny边缘检测算法 step1:用高斯滤波器平滑图象； step2:用一阶偏导的有限差分来计算梯度的幅值和方向； step3:对梯度幅值进行非极大值抑制； step4:用双阈值算法检测和连接边缘 -Edge Detection (Canny algorithm) to the Java Canny edge detection algorithm ste p1 : Gaussian smoothing filter image; step2 : with a partial derivative of the finite difference to calculate the gradient amplitude and direction; step3 : gradient amplitude of the non-maximum inhibition; step4 : dual-threshold algorithm for edge detection and link
Platform: | Size: 57344 | Author: 常 | Hits:

[Other] pagerank

Description: 用于实现pagerank算法编程，只是一个算法，节点代表网页，边代表连接。-to achieve hl_end programming algorithm, only one algorithm, node representative website edge represents a link.
Platform: | Size: 1024 | Author: | Hits:

[Special Effects] EdgeDetection

Description: 本实验室编写的边缘检测代码，并且应用程序已为您创建了动态链接库EdgeDetection.DLL。-The laboratory prepared edge detection code, and the application has been created for you a dynamic link library EdgeDetection.DLL.
Platform: | Size: 1138688 | Author: 戴志 | Hits:

[Special Effects] WvltFilter

Description: 本实验室编写的边缘检测代码，并且应用程序已为您创建了动态链接库WvltFilter.DLL。-The laboratory prepared edge detection code, and the application has been created for you a dynamic link library WvltFilter.DLL.
Platform: | Size: 1141760 | Author: 戴志 | Hits:

[Special Effects] edgelink

Description: 边缘提取的matlab源代码，第一次上传程序，不知道能不能成功，仅供参考。-Edge of the matlab source code, the first upload process, do not know can be successful, for informational purposes only.
Platform: | Size: 3072 | Author: lisi | Hits:

[Windows Develop] shortpath

Description: 题目：最短路由计算题目描述：INTERNET中通过路由器在多个网络中进行数据报的转发，在研究路由问题的时候，可以把每一个路由器、局域网或者广域网都抽象为一个结点，每条链路则用带有方向的边表示，边上的权值表示相邻结点的代价值。于是可以根据最短路径算法得出最佳的路由表。 -Title: Calculation of the shortest route subject description: INTERNET by routers in a number of network datagram forwarding, routing problems in the study, they can each router, LAN or WAN are abstracted as a node point, each link is used with the express direction of the edge, the edge of the right to express the value of adjacent nodes in lieu of value. It could thus be the basis of the shortest path algorithm to draw the best routing table.
Platform: | Size: 64512 | Author: lipeng | Hits:

[Graph program] hough

Description: 这是基于图像处理，用MATLAB编程，对知道图像进行边缘提取和hough线链接的程序-This is based on image processing, using MATLAB programming, to know that the image edge detection and hough line procedure link
Platform: | Size: 1024 | Author: 周源 | Hits:

[Special Effects] ruzon.tar

Description: 指南针边缘检测算法是当前质量最高的边缘检测方法，比CANNY算子效果还要好。具有边缘定位准确，边连续，完整的特点。程序能够得到每一个像素的边的朝向，有利于做进一步的优化应用，例如图像分割等。具体算法过程可参考斯坦福大学麦克博士发表的论文。主要思路就是以每个像素为中心，像罗盘一样转动边，一直找到两边差异最大的朝向。最后把所有的最优朝向连起来成为边缘。代码用VC驱动，核心部分用matlab编写-Compass edge detection algorithm is currently the highest quality of edge detection methods, than CANNY operator even better results. With edge positioning accuracy, while continuous, full features. Program can be a pixel for each side towards is beneficial for further optimization of applications, such as image segmentation and so on. Specific algorithms may make reference to Stanford University Maikeboshi the published papers. Main idea is to each pixel as the center, the same rotation as the compass edge, has been to find the greatest difference between both sides of the orientation of. Finally all the best to link into the edge towards. Code using VC-driven, the core part of the preparation with matlab
Platform: | Size: 82944 | Author: 黄沛杰 | Hits:

[Graph program] canny

Description: canny检测器是很有效的边缘检测器，该函数可以实现对目标图像的边缘提取。该方法总结如下：1.图像使用带有指定标准差的高斯滤波器来平滑，以此减少噪声；2.在每一点计算局部梯度和边缘方向；3.第二步中确定的边缘点会导致梯度幅度图像中出现脊，然后追踪所有脊的顶部，并将所有不再脊顶部的像素设置为0；4.执行边缘链接-canny detector is very effective edge detector, this function can be achieved on the target image edge detection. This method is summarized as follows: 1. Image used with the specified standard deviation of the Gaussian filter to smooth out, thereby reducing the noise 2. In the calculation of each point of local gradient and edge direction 3. The second step in determining the edge points will led to the image gradient magnitude ridge appears, and then keep track of all of the top of the ridge, and ridge at the top of all the pixels are no longer set to 0 4. the implementation of the edge link
Platform: | Size: 185344 | Author: hanyantao | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list

[Other resource] graphDegree

[Multimedia program] CannyJava

[Other] pagerank

[Data structs] graphDegree

[Multimedia Develop] CannyJava

[Other] pagerank

[Special Effects] EdgeDetection

[Special Effects] WvltFilter

[Special Effects] edgelink

[Windows Develop] shortpath

[Graph program] hough

[Special Effects] ruzon.tar

[Graph program] canny

[Graph Recognize] linkedge

[Special Effects] link-edge

[Special Effects] edgelink

[Special Effects] Edge-Linking--Line-Fitting

[Other] Implementasi-Metode-Edge-Linking-untuk-Setyo-Nugr

[Special Effects] fast-edge

[Graph Recognize] matlabTest

CodeBus www.codebus.net