搜索资源列表
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
ShortestPathsEdge
- In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
EDGE_SOBER
- The program is used to detect the edges of the image using Sobel method.
EDGE_LAPLASS
- This program is used to detect the edges of the image using Laplass method.
Canny_method
- I think some of the edges aren t getting detected becuase of the sobel filters not catching the edges, but I m not sure. I think the thick lines are from not doing the supression and hysteresis properly. Here is my canny edge code and convolution
HARTLEY.ZIP
- The frequency domain plays an important role in image processing to smooth, enhance, and detect edges of images. Although image data typically does not include imaginary values, the fast Fourier transform (FFT) has been used for obtaining spect
draw-tree
- 伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in such a way that both of the edges
Hough
- Hough变换 使用matlab随机函数，计算输入图像的Hough变换。-Hough Transform.Use matlab s radon function to compute the hough transform.or threshold its edges.
NonlinearDiffusionFilteringOfImages
- PhD thesis on nonlinear diffusion filtering of images using the topological gradient approach to edges detection
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
6
- 利用c语言编写程序，由键盘输入多边形的边数，求其内角和。-Programming using c language, keyboard input from a number of polygon edges, and the angles and.
odib
- 纯C语言开发的图标/图片按钮源代码，这个程序中使用了字体font, 绘制形状shape, 绘制边edge, 绘制颜色color, 使用刷子brush 和钢笔pen完成。 -Although Windows has a really cool GUI, sometimes the way standard buttons look quite does not meet our requirements. We may then choose buttons with a style call
tiduruihua
- 梯度锐化：通过处理使图像的棱角更加分明，边缘对比明显-Gradient sharpening: by processing the image edges and corners to make more clear, obviously the edge contrast
studyforrecognitionofinfraredimagebasedonfeaturein
- ：给出了一种提取特征点的新方法和合理的特征不变量。该方法根据三角不等式原理利用第三边与另 外两边之和的比值大小来确定角点，以特征点和它相邻的两个特征点所形成的两条直线的夹角正切值以及三角形 第三边与另两边和的比值作为特征不变量。这种特征提取的方法简单，并且由于扩大了模板取值范围，使识别效果受特征点漏检的影响较小。实验表明，该方法不仅简便，而且效果良好。-: In this paper, a new feature point extraction method and the chara
xmouse
- The all mighty mouse: you can have more memory, you can have blue-ray discs but you are still using the mouse (and the keyboard) to control your computer. The mouse pointer lets you select objects on the screen and operate on them. What and how
csc562HW1Sol
- The search tree has a branching factor of 4. All edges have unit costs except those that go to states 5, 8 and 9 (cost 3). The node-counts given below include the start and the goal nodes (if you indicate otherwise and your answers are consistent the
EdgeAttributes
- SolidWorks的二次开发 为边添加属性 遍历零件的所有面和边，查找所有的直线-Add attributes for edge traversal of all parts of the surface and edges, find all the straight-line
ColorFeatures
- 一种彩色图像边缘检测的算法。实现J.van de Weijer的" Robust Photometric Invariant Features from the Color Tensor"-The quasi-invariant derivatives can be used to suppress undesired edges such as shadow, shading and specular edges. LITERATURE: J. van de Weijer, Th. Gev