搜索资源列表
EdgePF
- 针对指纹图像的纹理性，编程实现的一种边缘保持滤波算法，可以滤除噪声的同时，保持边缘的清晰。-While maintaining the filtering algorithm is directed to an edge of the fingerprint image texture, programming, and can filter out the noise, of maintaining sharp edges.
enhancefil001
- This code will enhance the image linearly with the help of spatial transformation. It enhance the image without noise at the edges.
Countwave002
- This code will enhance the image with the wavelet processing. It enhance the image with the sharp edges.
enhanceclahe001
- This code will enhance the image linearly with the help of histogram, equalization. It enhance the image without noise at the edges.
enhancegray003
- This code will enhance the image linearly with the help of histogram, equalization. It enhance the image without noise at the edges.
1
- GN算法是一种分裂型的社区结构发现算法。该算法根据网络中社区内部高内聚、社区之间低内聚的特点，逐步去除社区之间的边，取得相对内聚的社区结构。(GN algorithm is a divisive community structure discovery algorithm. According to the characteristics of high cohesion within the community and low cohesion between communities, th
edges-master
- 使用matlab的边缘检测工具箱, 里面包含各种代码(edge detedtion, matlab toolbox)
spectalCluster
- 谱聚类是从图论中演化出来的算法，后来在聚类中得到了广泛的应用。它的主要思想是把所有的数据看做空间中的点，这些点之间可以用边连接起来。距离较远的两个点之间的边权重值较低，而距离较近的两个点之间的边权重值较高，通过对所有数据点组成的图进行切图，让切图后不同的子图间边权重和尽可能的低，而子图内的边权重和尽可能的高，从而达到聚类的目的。(Spectral clustering is an algorithm evolved from graph theory, and has been widely u
贪婪算法
- 用某种方法选择n-1条边使它们形成G的最小生成树。至少可以采用三种不同的贪婪策略来选择这n-1条边。(Choose n-1 edges in some way so that they form the minimum spanning tree of G. At least three different greedy strategies can be used to select this n-1 edge.)
2
- diffrent kind of Laplacian filter on image for finding Edges.
GrTheory
- 多种图论算法的matlab实现 例如：% ntest=1 - grBase求有向图的基 % ntest=2 - grCoBase求有向图的逆基 % ntest=3 - grCoCycleBasis求连通图的基本割集 % ntest=4 - grColEdge图的边着色（边染色） % ntest=5 - grColVer图的点着色（节点染色）(% grBase - find all bases of digraph; % grCoBase - find all contrabases
detectLandmarks
- to find corner for face edges
cornerfeature
- using corner feature to detect the face edges. and algorithm of calculate distance
boundaryClose
- Closing edges using matlab
adjacency matrix to represent the graph
- (1)使用邻接矩阵表示图，定义相应的抽象数据类型。 (2)实现两个图ADTs的上述函数。 (3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。 (4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type. (2) Realize all the above functions for the two graph AD
最大二分配法
- 如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match
WS小世界网络MATLAB
- % The simulation of WS-smallworld network % the algorithm of WS-smallworld's generation has been improved in speed, % and tend to be easily understood % writen by winter-my-dream@hotmail.com % Example: % N = 100; %network size (number of nodes)
Burgers_equation
- The 1D Burgers equation is solved using explicit spatial discretization (upwind and central difference) with periodic boundary conditions on the domain (0,2). The 2D case is solved on a square domain of 2X2 and both explicit and implicit methods are
网络抗毁性，MATLAB仿真
- Matlab中对建立好的网络进行节点/连边随机、蓄意攻击，用最大连通子图、网络效率来衡量网络的抗毁性，并找出最关键的节点的仿真程序。(In MATLAB, the nodes / edges of the established network are attacked randomly and intentionally. The invulnerability of the network is measured by the maximum connectivity sub graph a
最小生成树
- 问题描述：给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。 基本要求： 1、城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本中给出的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括了哪些城市间的道路，并显示得到的最小生成树的代价。 2、表示城市间距离网的邻接矩阵（要求至少6个城市，10条边） 3、最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。