搜索资源列表
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
6
- 利用c语言编写程序，由键盘输入多边形的边数，求其内角和。-Programming using c language, keyboard input from a number of polygon edges, and the angles and.
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
disanti
- (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO
oular
- 离散数学里面的欧拉回路问题，先输入顶点数和边数，然后把边的两个顶点输入。-Discrete Mathematics inside loop Euler problem, enter the number of vertices and edges, and then the input side of the two vertices.
Bilateral
- bilateral filter. 能夠完整保留邊界資訊而不被模糊-A bilateral filter is an edge-preserving smoothing filter. Whereas many filters are convolutions in the image domain, a bilateral filter also operates in the image s range—pixel values. Rather than simply replace a p
PL0
- 从NFA到DFA的转换过程是利用NFA的信息不断生成DFA的状态结点和边的过程，或者说是生成DFA自动机转换表元素的过程。求ε-闭包也就是把用ε边连接起来的状态合并起来的过程，被合并的状态集将形成DFA的一个状态，因此DFA的状态被表示为NFA的状态子集。 用SS(状态集)的形式表示DFA的状态。假设SS表示新产生的状态，则下一步的工作是：对每个符号a考虑其边和该边的指向状态。 -From the NFA to DFA conversion process is the use of i
prim
- Find the sum of the edges of the minimum spanning tree of a graph using the Prim s algortithm.
Keyboard
- 由键盘输入多边形的边数，求其内角和 大家参考一下-Keyboard input from a number of polygon edges, and its angle and
cross_bf
- The bilateral filter is a nonlinear filter that does spatial averaging without smoothing edges. It has shown to be an effective image denoising technique. It also can be applied to the blocking artifacts reduction. An important issue with the applica
HarrisJiaoDianJianCe
- Harris算法是最常用的图像角点检测算法之一。-HarrisJiaA corner can be defined as the intersection of two edges. A corner can also be defined as a point for which there are two dominant and different edge directions in a local neighbourhood of the pointoDianJianCe
Kruskal
- kruskal算法（附注释）：将边按照权值由小到大排列，然选取一条边，如果和前面的边一起不能构成环则加入该边，否则舍弃改变，执行下一条边，这里的环就是由集合来表示的，nodes[i]=j 表示i节点的顶点时j，-kruskal algorithm (annotated): the edge of the right in accordance with the value of small to large order, ran select an edge, if and front edge
sheji
- 现实生活中，常常会遇到求最短路径的问题。本设计旨在提供一种解决这类问题的实例，把某一公园的景点与路线抽象成顶点和边，从而构成图，进而解决一系列相关的最短路径，最佳路线等问题。-In real life, often encountered in seeking the shortest path problem. This design is intended to provide a solution to an instance of such problems to a park attr
DIJKstra
- DIJKstra最短路径 这里路径指两顶点间的通路，路径的长度指所有经过的边的总长。“最短路径”的问题指当两个顶点间通路多于一条时，如何找出边长总和为最短的那条。Dijkstra提出按路径长度递增的次序求最短路径的方法。-DIJKstra path here refers to the shortest path between two vertices of the path, the path length refers to all through the length of the
poloy
- 输入相应的边数自动生成旋转的多边形,可以调节旋转角度等相关控制-Enter the appropriate number of edges of the polygons rotate automatically generated and can adjustable rotation angle and other related control
threshold
- These programs perform automatic thresholding of thin connected edges.
EdgeContour
- 关于图像处理方面的几个处理图像边缘轮廓的几种算法-With regard to image processing several edges of several image processing algorithms
SchoolScenes_Guide
- 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。 要求事先一下功能： （1） 查询各顶点的相关信息。 （2） 查询图中任意两个景点之间的最短路径。 （3） 查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of
Snap-09-11-25
- 斯坦福大学社会网分析应用包用c语言编写，实现了社会网络分析算法库函数-Stanford Network Analysis Package (SNAP) is a general purpose network analysis and graph mining library. It is written in C++ and easily scales to massive networks with hundreds of millions of nodes, and billions of