登录
首页 » matlab » snake

snake

于 2015-05-10 发布 文件大小:15KB
0 195
下载积分: 1 下载次数: 5

代码说明:

  此代码为传统的snake模型算法代码,运行其中的egsnake.m即可。该代码实现对图像的边缘检测,仅供大家一块学习交流(This code is the code algorithm of traditional snake model, which can run egsnake.m. The code to achieve the image edge detection, we only a learning exchange.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Vehicle-License-Plate-Localisation-r
    说明:  车牌识别,图像分割出车牌,然后进行具体识别,matlab源代码(vehicle license plate recognition)
    2019-06-27 17:27:50下载
    积分:1
  • wawtershed
    图像的三种分水岭分割方法,一般分水岭分割,使用梯度的两次分水岭分割及使用梯度加掩模的三次分水岭算法(images of the three watershed segmentation method, the general watershed segmentation, gradient of the two watershed segmentation and the use of the gradient increases mask the three watershed algorithm)
    2020-10-31 09:09:55下载
    积分:1
  • xiaobo
    说明:  小波变换,主要功能是实现图像纹理的提取。(Wavelet transform, the main function is to achieve the extraction of image texture.)
    2008-11-30 20:47:23下载
    积分:1
  • 源码:基于离散点的构TIN算法(三角网)
    含实验报告以及测试数据 基于离散点的构TIN算法 一、算法思想 (1)首先,找出离散点集中相距最近的两点,连接这两点形成TI、的初始基线。  (2) 然后,找出包含此基线的另外一个点构成三角形。寻找第三点的方法: △按Delaunav三角形的判断法则乎找第三点。 △或者.按距离基线中点最近的原则挤找第三点。 (3)连接孰点与基线的两个端点形成两条新边,构成三角形。  (4)抓这两条新边为基线,重复上述过程。直到两条新边扩展完成。  (5)重复上述过程,依次循环处理所有新边。直到所有离散点均成为TIN的端点。
    2020-01-02下载
    积分:1
  • demo
    源码包括了常用的图像处理方法,代码详细,适合初学者(Source code, including the commonly used image processing method, the code in detail, suitable for beginners)
    2013-07-12 21:31:55下载
    积分:1
  • tuxiang
    四种滤波(SVD滤波,PCA滤波,DCT滤波,DWT滤波)对图像处理,有程序代码和对应图片(Four kinds of filter for image processing)
    2020-06-29 20:40:02下载
    积分:1
  • finally
    实现了车辆目标的背景建模、前景检测、阴影消除、车辆跟踪(Achieve a vehicle target background modeling, foreground detection, shadow elimination, vehicle tracking)
    2013-07-22 21:36:10下载
    积分:1
  • Graph
    输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
    2020-12-13 15:29:15下载
    积分:1
  • uwbfft2
    超宽带雷达信号二维FFT求速度和距离,速度补偿后的算法(Ultra-wideband radar signal 2D FFT for speed and distance, speed compensated algorithm)
    2013-02-25 23:26:09下载
    积分:1
  • Supervised
    说明:  遥感信息工程学院遥感原理与应用课程实习监督分类(Supervised of Remote Sensing Principle and Application Course Practice)
    2019-05-24 08:43:58下载
    积分:1
  • 696516资源总数
  • 106562会员总数
  • 4今日下载