登录
首页 » matlab » SegmentImage

SegmentImage

于 2013-02-11 发布 文件大小:382KB
0 258
下载积分: 1 下载次数: 3

代码说明:

  image segmentation,very good

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

发表评论

0 个回复

  • c18_cdmacal
    耦合影响格子序列仿真,随机性,平衡性,级多瓣分治混沌序列在cnma中的应用(Simulation of the impact of lattice coupling sequence, randomness, balance, class of chaotic sequence多瓣divided the application in cnma)
    2009-06-03 11:37:17下载
    积分:1
  • ipixload
    ipix数据载入以便于使用此来进行杂波编程(ipix datesets download)
    2012-04-05 20:08:31下载
    积分:1
  • fcm8
    matlab关于fcm图像聚类 分成8类(about the method of fcm)
    2013-05-07 18:19:56下载
    积分:1
  • ARMA(2)
    ARMA模型的matlab实例,希望可以帮到大家(ARMA model matlab example and I hope you can help)
    2020-12-16 14:39:13下载
    积分:1
  • fir
    fir 滤波器 Systems generator 实现并转化为verilog语言(fir Filter Systems generator to achieve and into verilog language)
    2009-11-06 11:59:50下载
    积分:1
  • wgn
    给需要的朋友参考 主要是滤波器的设计 大家可以下下来 作为设计的基础参考(Reference to a friend in need is mainly designed to filter down we can make a basis for the design reference)
    2010-01-13 15:18:11下载
    积分:1
  • INT01
    说明:  P1口的8个灯循环亮,按P32后全部闪烁5次后继续循环亮, 中断程序的典型应用。 (P1 mouth of the eight bright light cycles, according to P32, all the flashes five times after the continued cycle of light, interrupt procedures typical application.)
    2010-03-22 15:29:19下载
    积分:1
  • tsp
    蕞优分组周游路线问题是一类物流智能调度问题,是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后,人们对这一类问题给予了极大的关注并进行了大量的研究,提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大,纯数学方法在允许的时间和空间上都很难找到问题的最优解,于是人们开始转向寻找问题的近似最优解,遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效,但对于有多个限制条件的多目标最优化问题缺显得有点力不从心,很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法,虽然建模条件限制了描述的问题的通用性,有待推广,但它能有效利用问题的领域知识,提高了求解效率,保证了解的可行性和最优性,算法思想极具推广潜力,可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)
    2014-08-18 10:05:55下载
    积分:1
  • Untitled
    uwb A Framework for UWB-Based Communication and Location Tracking Systems for Wireless Sensor
    2011-11-30 19:37:05下载
    积分:1
  • pca2D
    matlab code for 2DPCA
    2015-04-04 20:28:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载