登录
首页 » matlab » level_set

level_set

于 2007-01-26 发布 文件大小:1KB
0 244
下载积分: 1 下载次数: 91

代码说明:

  在图象处理中,用matlab求水平线、水平集以及水平集动画显示(in image processing, using Matlab for the horizon, level sets, and sets the level of animation shows)

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

发表评论

0 个回复

  • E-book
    E-book for WiMAX_Technology
    2010-11-08 23:31:00下载
    积分:1
  • dep2time
    时深转换小程序,很实用................(time to depth,useful)
    2015-03-24 11:39:59下载
    积分:1
  • Evaluate
    评价图形的MSE,SNR,PSNR的GUI。(A GUI to evaluate the image s MSE,SNR and PSNR.)
    2010-05-14 14:23:19下载
    积分:1
  • AGC_sourcecode
    自动增益控制AGC的Matlab源码,其中注释部分对原理进行了详尽的介绍(AGC source code for audio gain control, details has been gaven in the comments)
    2021-01-26 20:58:40下载
    积分:1
  • fullCarModel
    这是一个车辆仿真模型,总共6个自由度,车身两个,车轮四个(This is a vehicle simulation model, with a total of 6 degrees of freedom, two bodies and four wheels.)
    2017-12-03 21:37:52下载
    积分:1
  • p1104
    基于能量检测认知无线电的算法仿真实现,里面含有高斯白噪声的添加(Cognitive radio based on energy detection algorithm simulation, which contains Gaussian white noise is added)
    2013-05-25 15:40:32下载
    积分:1
  • matlab
    matlab中使用文本文件进行数据存取的技巧总结 (matlab text file using the techniques for data access summary)
    2010-12-14 06:37:07下载
    积分:1
  • ReportOnOFDM
    can be usefull it report on OFDM principle and basic operation
    2011-01-10 10:23:20下载
    积分:1
  • littleworld
    NW小世界网络的构成原则为:从一个环状的规则网络开始,网络含有N个结点,每个结点向与它最近邻的K个结点连出K条边,并满足N>>K>>In(N)>>1。随后进行随机化加边,以概率p在随机选取的一对节点之间加上一条边。其中,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时,NW小世界模型本质上等同于WS小世界模型。 (NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)
    2013-04-26 21:17:37下载
    积分:1
  • bizhang
    粒群算法寻找好绕过障碍一点到另一点的最优路径(Particle swarm algorithm for finding good around the obstacle one point to another point of the optimal path )
    2014-12-30 20:45:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载