登录
首页 » matlab » regiongrowing

regiongrowing

于 2015-02-28 发布 文件大小:1KB
0 138
下载积分: 1 下载次数: 1

代码说明:

  it is code for segment imafe using region growing

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

发表评论


0 个回复

  • denoise2
    本程序是基于LeventCode平台作的。包括以下方法:BivaShrink方法、模型1、模型2、模型3(TrivaShrink方法)、BayesShrink方法、LAWMLShrink方法的DWT实现和DT_CWT实现(This procedure is based on the platform for LeventCode. Including the following methods: BivaShrink method, model 1, model 2, model 3 (TrivaShrink method), BayesShrink methods, LAWMLShrink methods DWT realize and realize DT_CWT)
    2007-10-22 20:57:25下载
    积分:1
  • pcaAlgorithm
    MATLAB code for generating faces using PCA. Displays all of the eigenfaces in a separate figure.
    2009-11-05 08:48:25下载
    积分:1
  • zhifangtu
    这个代码是直方图的一个应用,可以帮助了解直方图。(This code is an application of the histogram can help to understand the histogram.)
    2010-06-01 00:33:27下载
    积分:1
  • IncCond_MPPT
    光伏电池最大功率点跟踪方法的扰动观察法的s函数(S function of the method of maximum power point tracking of photovoltaic cells perturbation and observation method)
    2013-04-16 10:46:50下载
    积分:1
  • 边缘提取函数
    说明:  用MATLAB实现的边缘提取函数,实现了sobel算子、canny算子,Robert算子、prewitt算子(Using MATLAB to achieve the edge extraction function, sobel operator, Canny operator, Robert operator, Prewitt operator)
    2020-10-18 17:07:24下载
    积分:1
  • classic_beamforming
    classic beamforming: wiener-hopf,SMI,LSMI,Hung-turner projection, eigenspace-bacsed beamformer
    2010-11-17 04:52:45下载
    积分:1
  • 27796724STATCOM_simulink
    STATCOM MODEL FOR AC POWER GENERATORS
    2017-11-10 20:15:42下载
    积分:1
  • wpt
    电磁耦合无线输能系统仿真,关于磁线圈状态的仿真(wireless power transport)
    2020-06-29 13:20:02下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • ht666
    本科毕设要求参见标准测试模型,基于K均值的PSO聚类算法,用MATLAB编写的遗传算法路径规划。( Undergraduate complete set requirements refer to the standard test models, K-means clustering algorithm based on the PSO, Genetic algorithms using MATLAB path planning.)
    2017-03-26 21:25:13下载
    积分:1
  • 696518资源总数
  • 105243会员总数
  • 13今日下载