搜索资源列表
Linear_and_non
- Linear and non-linear approximation with wavelets Linear approximation is obtained by keeping M low frequency coefficients and then applying the inverse wavelet transform. Here we take M=n^2/4 by keeping n/2 x n/2 low frequency coefficients. Lin
gui
- 一个简单matlab gui编程的例子 进行边缘检测-a sample example program bt matlab gui, Find edges in a picture
edge
- edge detection. can detection edges a image using matlab. for digital image processing
medfilt2m
- 2-D median filtering with better boundaries response. A modified version of the MATLAB function medfilt2 that deals better with the boundaries. Unlike medfilt2, the function medfilt2m does not pad the matrix with extra elements on the edges, but comp
schoolguide
- 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。--Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile an
floyd_warshall.c
- It is the source code of the Floyd-Warshall algorithm for finding the shortest path between all nodes. The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal
hysthresh
- matlab code-Function performs hysteresis thresholding of an image. All pixels with values above threshold T1 are marked as edges All pixels that are adjacent to points that have been marked as edges and with values above threshold T2 are als
IEEEXplore
- Find edge for an input gray image Input:an gray scale image Output: 1.Image_OE:the detected edge reference:P. Perona and J. Malik. Detecting and localizing edges composed of steps, peaks and roofs. ICCV, 1990- Find edge for an input
SchoolScenes_Guide_PerfectVersion
- 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。 要求事先一下功能： （1） 查询各顶点的相关信息。 （2） 查询图中任意两个景点之间的最短路径。 （3） 查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of
bifilter.m
- performs bilateral filter. smoothens homogenous region while keeping the edges intact
youleyuan
- ⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 -⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions sto
Graph
- 1．建立无向网的邻接矩阵。 要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。 2．对无向网进行深度优先遍历，输出遍历序列。 3.判断给定的无向网是否是连通的？ 要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke
luyou
- 用无向网表示大学城的10个校园的平面图，图中顶点表示学校某个建筑（可以一个学校选择一个代表性的建筑），图中的边表示学校间的道路，存放路径长度等信息。要求能够回答游览路径等问题。-Free to the net means that the 10 university city campus plan, the graph vertices that school to a building (you can choose a representative, a school building),
SigmaValue
- 轮廓特征提取,提取图像的边缘，特征码vc++c写的，里面还有论文，是一次作业。-Contour feature extraction,extract the image edges,signature
dog
- Difference of gausian method for detecting edges
KRUSKAL
- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o
tissue5
- Program Descr iption: plot a fiber network, label its edges and vertices, read and display the forces
Simulator
- 模拟蚂蚁和食蚁兽的生存规律。在20X20的网格世界里，每个生物每次可向四个方向移动（但不会移除网格边缘），食蚁兽会吃掉在他目标处的蚂蚁-The goal for this programming project is to create a simple 2D predator-prey simulation. In this simulation the prey are ants and the predators are doodlebugs. These critters l
GrTheory
- 图论的相关MATLAB CODE 非常好用-grBase- find all bases of digraph grCoBase- find all contrabases of digraph grCoCycleBasis- find all independent cut-sets for a connected graph grColEdge- solve the color problem for graph edges grColVer- sol
Adjacentmulti-tablestoragegraph
- 从键盘上输入一串数偶，如（A，B）表起始结点为A，终止结点为B的无向边。若A，B不存在于图中，则先将两个结点A，B存入图中，再将边（A，B）存入图中。最后显示图中已经存入的结点和边的数目。-Enter the string of numbers from the keyboard even if (A, B) form the starting node for the A, B, end node is free to the edge. If A, B does not exist in t