登录
首页 » matlab » GVFSnake(matlab)

GVFSnake(matlab)

于 2008-02-01 发布 文件大小:1920KB
0 109
下载积分: 1 下载次数: 366

代码说明:

  GVF snake用matlab实现,可用于图像边缘检测和分割(GVF snake with matlab realize, can be used for image edge detection and segmentation)

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

发表评论

0 个回复

  • 6
    说明:  little matlab script but still no error
    2014-10-13 21:59:25下载
    积分:1
  • psins151009
    MATLAB 工具箱,可用于惯性导航的常用模拟,包括器件误差、平台误差、纯惯导解算、惯导与GPS融合、惯导与DR融合、初始对准等滤波算法(Filtering algorithm MATLAB toolbox can be used to simulate conventional inertial navigation, including device error, error platform, Inertial Navigation solver, INS and GPS integration, integration of INS and DR, initial alignment, etc.)
    2021-02-21 17:19:42下载
    积分:1
  • c++
    说明:  用c++编的关于图书系统的一个实例子,有参考价值(With c++ Series on the book an example of sub-systems, there are reference value)
    2008-10-10 09:56:21下载
    积分:1
  • polygeom
    Code for obtaining Center of math of polygon. enjoy it.
    2013-11-09 01:17:05下载
    积分:1
  • ML_detection
    用似然比方法对信号是否到达进行检测的Matlab源程序,希望采纳(Likelihood ratio method for detecting whether the signal reaches the Matlab source code, hope to adopt)
    2014-02-23 20:01:53下载
    积分:1
  • winrats
    如何用winrats做garch-bekk模型(how to use winrats creat garch-bekk)
    2019-04-30 15:40:05下载
    积分:1
  • improved_jakes
    This code implies the improved Jakes Method( Y. R. Zheng and C. Xiao, Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms, IEEE Comm. Lett., vol. 6, no. 6, pp. 256-258 (2002) ) to simulate Rayleigh fading
    2009-06-29 20:16:20下载
    积分:1
  • numericalanalysis
    编写的数值分析相关源程序(bisection method,微分),大家一块互相学习。(bisection method)
    2011-06-13 17:41:32下载
    积分:1
  • yichuansuanfa
    遗传算法和最速下降法的比较及其各自的优缺点(Genetic algorithms and compare the steepest descent method and their respective advantages and disadvantages)
    2013-12-22 21:33:36下载
    积分:1
  • Travelling-salesman-problem-algorithm
    The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
    2013-12-30 00:26:10下载
    积分:1
  • 696518资源总数
  • 104432会员总数
  • 16今日下载