搜索资源列表
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
jishui
- 一块不平整长方形土地坑坑洼洼，大雨过后，坑里都积满了水（假设边界以外的地方高度都低于边界，见下面示意图，灰色部分为长方形土地，其中深灰色部分为边界；白色部分为边界以外的地方；数字为每小块土地的高度；边界以外的数据不需要输入）。 把这块土地划分成N×M块，每块大小都是1cm×1cm。如果已知每小块土地的高度（值为正整数，单位：cm），求这块土地共可以积水多少立方厘米（积水土坑的边界只考虑前后左右，不考虑斜方向，如上图，阴影部分为可以积水的地方）。数据输入（要求使用文件输入）：第一行是N、M的值
33
- 在利用曲波对图像进行分解的基础上，提出了一种考虑不同尺度分量的曲波系数间是相互关联的系数概率密度函数(PDF)模型，不同尺度的系数选择依赖其父层系数的大小，从而保证在去除噪声的同时，保留图像的纹理边缘等细节信息，然后对图像进行重构-In the use of curvelet decomposition of the image is proposed based on a consideration of different scale components curvelet coeffici
code1
- this source code is used to decompose the image into 3 level using discreat wavelet transform. at each level image is decomposed into 4 levels , LL ,LH,HL,HH LL is the approximation of the image the other are the details of image like edges
MiniSpanTree-Kruskal
- 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it
berteroheadmodel
- Analytical expressions for the vector magnetic fields and Fourier transforms associated with thin film heads are presented. These results are derived from accurate, approximate expressions for the surface field of an asymmetric thin film head determi
hongwaituxiang
- 为了在抑制噪声时尽可能保留图像边缘信息，提出一种自适应各向异性高斯滤波器设计方法. 该方法由独立 强度传播（IDS）模型决定滤波器的长轴尺度，由像素的邻域平滑度决定长短轴的比例，然后根据该处的灰度梯度方 向自适应决定各向异性滤波器的长轴方向. 仿真实验表明，提出的自适应各向异性滤波器具有很强的噪声抑制和 边缘保持能力. -In order to suppress noise, as far as possible to keep the image edge informati
GraphTraversal
- 使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。 设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。 -Using c language data structure used to establish the adjac
Acivs09Code
- AbstractWe investigate the problem of pedestrian detection in still images. Sliding window classifiers, notably using the Histogram-of-Gradient (HOG) features proposed by Dalal and Triggs are the state-of-the-art for this task, and we base our method
susan_edge_mfctest
- Susan Edge Detection MFC demo - this demo detects edges quickly. Includes actual edge detection algorithms. Can be used with CxImage fairly easily.-Susan Edge Detection MFC demo - this demo detects edges quickly. Includes actual edge detection algori
KRUSCAL
- KRUSCAL算法实现演示程序，利用KRUSCAL算法求网的最小生成树，网中的节点和边由系统自动生成，图为带权图。-KRUSCAL algorithm demo program, using KRUSCAL minimum spanning tree algorithm to solve network, network nodes and edges generated automatically by the system, photo shows a weighted graph.
Diffusion
- the package contains some methods of diffusion filters to smooth the noisy images without losing important data such as edges in image analysis,including anisotropic diffusion(Perona-Malik), linear isotropic,median and Low Pass Gaussian filter.
mxGraph_pojie
- msgraph Hello, World! example for mxGraph. This example demonstrates using a DOM node to create a graph and adding vertices and edges. -msgraph Hello, World! example for mxGraph. This example demonstrates using a DOM node to create a
PathFinder
- In Graph Theory it is often required to find out all the possible paths, which can exist between a source node and a sink node. So this function returns a all such possible paths, in a matrix format. INPUTS: 1. X Matrix: Form a Nx2 matrix, wher
m
- 该程序将一个480*640的图像进行了中值滤波，然后分成四小幅，进行了阈值化，提取出了图像边缘，并将边缘与图像放一起比较，以调试边缘与原程序的稳合程度。-The program will be a 480* 640 images of the median filter, and then divided into four small, to the threshold of extracted image edges, and edge compared with the images pu
RegionBasedSnake
- 基于区域的主动轮廓模型算法，是论文《Active Contours Without Edges》的VC算法实现-Region-based active contour model algorithm, for the paper " Active Contours Without Edges" of the VC algorithm
harris_pudg
- Gradient information serves several purposes. It can relate the structure of objects in an image, identify features of interest for recognition/classification directly or provide the basis of further processing for various computer vision