搜索资源列表
automatic-classification-cluster
- 一、问题描述若要在n个城市之间建役通信网络，只福要架设n-1条级路即可．如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。二、基本要求 （1）利用克鲁斯卡尔算法求图的最小生成树。 （2）能实现教科书6.5节中定义的抽象数据类型MFSet.以此表示构造生成树过程中的连通分量。 (3 ) 以文本形式输出生成树中各条边以及他们的权值．三、需求分析 1、构造图结构。 2、利用克鲁斯卡尔算法求图的最小生成树。 3、完成生成树的输出。 -I. Descr iption of the proble
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
Canny
- 采用canny算子提取边缘，具体请看里面的说明。-use canny operator to extract edges.
RoutingSystem
- The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as ed
GlVideoManager
- VideoMan (Video Manager) is an open-source C++ library that helps you developing video based applications. We created VideoMan to increase our productivity developing computer vision applications, but it can be used in many other ways. With Vid
network
- this a program for training the network for destinguish between numbers depending on features of the numbers these features are the defferent kinds of edges in six parts of the number picture-this is a program for training the network for destinguish
synchronisation
- This circuit is a nice edge detector that gives you synchronous notification of edges on your input signal. There s no excuse for not doing this it s a tiny circuit in just five lines of Verilog.-This circuit is a nice edge detector that gives yo
depthfirstsearch
- 深度优先搜索所遵循的搜索策略是尽可能“深”地搜索图。在深度优先搜索中，对于最新发现的结点，如果它还有以此为起点而未搜过的边，就沿着边继续搜索下 去。当结点v的所有边都已被探寻过，搜索将回溯到发现结点v有那条边的始结点。这一过程一直进行到已发现从源结点可达的所有结点为止。如果还存在未被发现 的结点，则选择其中一个作为源结点并重复以上过程，整个过程反复进行直到所有结点都被发现为止-Followed by depth-first search strategy is to search "
zhiwenshibiebaogao
- 模式识别小程序基于matlab的对图像边缘进行指纹识别-Pattern recognition based applets matlab edges of fingerprint images
oular
- 离散数学里面的欧拉回路问题，先输入顶点数和边数，然后把边的两个顶点输入。-Discrete Mathematics inside loop Euler problem, enter the number of vertices and edges, and then the input side of the two vertices.
HoughTransformconsole
- Using opencv, Hough Transformation extract lines from edges.
minimumtree
- 利用克鲁斯卡尔算法计算最小生成树,以文本形式输出生成树中各条边以及他们的权值。-Using Kruskal minimum spanning tree algorithm to output text in the spanning tree edges and their weights.
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
Kruskal
- 克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) -Thinking of Kruskal algor
MemoirematchingHausdorff
- In this study, approaches of image enhancement, edge extraction, and line-based image matching for remote sensing images are proposed. The image enhancement includes noise reduction and contrast enhancement. We apply wavelet shrinkage technique
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
Kruskal
- 本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译，可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the gre
Vision_with_Direction_A_Systematic_Introduction_to
- 第一辑：数学 代数部分、数值部分、几何拓扑部分、方程部分；第二辑：数据处理；第三辑：可视化；第四辑：系统和控制；第五辑：通信；第六辑：模式识别；第七辑：信号；第八辑：图像视觉-This introductory textbook presents the modern signal processing concepts used in computer vision and image analysis in a systematic and mathematically coherent
Project
- it is a image processing project which can find special and certain object with certain shapes in the images. it obtain the P and S for each object and compare P/S ratio to template image and object. Sobel use for P and finding edges and Labeling a
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