登录
首页 » matlab » kmean

kmean

于 2013-11-04 发布 文件大小:26KB
0 204
下载积分: 1 下载次数: 28

代码说明:

  利用k-means的算法实现图像区域分割,主程序只能运行灰度图像,彩色图像需另写调用程序(Using the k-means algorithm for image segmentation, the main program will only run grayscale image, color image subject to write the calling program)

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

发表评论

0 个回复

  • gkdj
    以为高斯和密度估计,使用高斯核的非参数密度估计方法,对样本进行概率密度估计,程序中给出了窗宽的估算公式。(That the Gaussian and density estimation, using Gaussian kernel non-parametric density estimation method, the sample probability density estimates, the program gives the formula for bandwidth estimation.)
    2010-06-21 09:55:47下载
    积分:1
  • space-timecodingproject
    这个程序主要是实现空时编码的matlab编解码仿真。(This process is implementation of space-time coding codec matlab simulation.)
    2009-03-07 21:29:47下载
    积分:1
  • chap_4
    matlab从入门到精通第4章书后源码对初学者很有帮助(matlab)
    2009-03-19 06:09:48下载
    积分:1
  • timing_jitter
    时间抖动对模数转换器性能的影响,对于有效比特精度的影响(the impact of timing jitter to ADC)
    2012-05-06 08:38:13下载
    积分:1
  • funciones
    those codes are very util for to designer signal processator
    2010-09-30 02:49:10下载
    积分:1
  • Nonlinear_differential_equation
    这是单自由度的非线性微分方程的求解程序(分段函数),可以画出动响应图和相图。(Nonlinear differential equation)
    2009-05-18 12:28:02下载
    积分:1
  • AOK4
    自适应优化核时频分布,包含文档和实现代码。(automated optimal TFD)
    2011-08-04 11:59:44下载
    积分:1
  • 1
    本程序实现LPP降维功能,用于多模态故障诊断中(This procedure realize the LPP dimension reduction function, used in multimodal fault diagnosis )
    2013-08-31 10:53:40下载
    积分:1
  • ofdm2
    orthogonal division multiplixing(ofdm) is a new scheme used in wireless communication systems its also called multicarrier system and achieved this. cyclic prefix is used to minimize the intersymbol interference(ISI) and intercarrier interference
    2014-01-17 15:12:25下载
    积分:1
  • knn1
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2017-08-09 21:06:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载