搜索资源列表
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
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
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
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.
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
Edge_Detection
- Edge Detection This demo finds the edges of objects in a video stream using the Prewitt method. You can double-click the Edge Detection block and adjust the Threshold parameter while the simulation is running. The higher you make the thre
AM
- FIRPM公园，麦克莱伦最佳equiripple FIR滤波器的设计。乙= FIRPM（不适用，女，甲）返回一个长度为N +1线性相位（真实，对称系数）FIR滤波器具有最佳逼近到所需的频率响应的F和描述在极小极大意义的。F是成对频带边缘载体，以递增0和1之间秩序。 1对应于奈奎斯特频率或采样频率的一半。至少有一个频段必须有一个非零宽度。 A是一个真正的载体，作为F的指定由此得到的滤波器的频率响应所需的幅度B相同大小- FIRPM Parks-McClellan optimal equirippl
EdgeContour
- 关于图像处理方面的几个处理图像边缘轮廓的几种算法-With regard to image processing several edges of several image processing algorithms
RockAndRoll
- Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be f
zidan
- 该程序利用小波分析，对两颗子弹弹痕上四条次棱的三维信息进行比对，判断两颗是否出自同一支枪-The program using wavelet analysis, the two bullet wounds and four times on the edges of the three-dimensional information for comparison to determine whether two guns from the same one! !
vcas_2009
- A method to detect new objects in a scene by comparing an input query image and a movie database captured beforehand is proposed. Our method is based on both feature point matching and edge matching. First, we select the most matched movie from t
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
Fill
- 实现多边形边缘填充，动画演示实现的具体过程。对图形学实验又指导作用。-Fill polygon edges to achieve
ex
- 扫描线算法,计算机图形学中的小练习，用以帮助忙不过来的广大人民-Scan the edges to dram
tsp
- In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano
wtut_sc
- DCM includes a clock delay locked loop used to minimize clock skew for Spartan-3, Virtex-II, Virtex-II Pro, and Virtex-II Pro X devices. DCM synchronizes the clock signal at the feedback clock input (CLKFB) to the clock signal at the input clock
SchoolScenes_Guide
- 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。 要求事先一下功能： （1） 查询各顶点的相关信息。 （2） 查询图中任意两个景点之间的最短路径。 （3） 查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of
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