登录
首页 » matlab » fast-fcm

fast-fcm

于 2012-06-05 发布 文件大小:2KB
0 203
下载积分: 1 下载次数: 147

代码说明:

  FCM源代码,专门用于图像分割的,速度很快(FCM source code, specifically for image segmentation, very fast)

文件列表:

改进后的基于直方图的快速FCM算法
...............................\FCMClust2.m,4441,2012-06-04

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

发表评论

0 个回复

  • c# jpg片转换成 bmp格式 实例
    c# jpg图片转换成 bmp格式 实例
    2013-05-20下载
    积分:1
  • view
    Matlab time-frequency analysis supporting the source code of chapter 12, please share
    2017-08-03 03:15:27下载
    积分:1
  • pinyulvbo
    利用VC进行图像的频域滤波处理,内含源代码(VC image using the frequency domain filtering treatment, including source code)
    2009-03-10 18:26:13下载
    积分:1
  • SVD
    数字水印,用于数字图像的加密,基于SVD的加密算法(Digital Watermarking)
    2020-07-04 14:00:02下载
    积分:1
  • color_ratio.m
    生物学中检测基因对颜色的影响,所以需要计算某种颜色占整体的比例(calculate color ratio)
    2015-06-23 22:59:50下载
    积分:1
  • xy7z
    无源双基地雷达直达波脉冲丢失与相位突变影响分析Passive bistatic radar direct wave pulse loss and phase change impact analysis(Passive bistatic radar direct wave pulse loss and phase change impact analysis)
    2012-05-18 22:27:07下载
    积分:1
  • compressed-sensing
    压缩感知,稀疏表示采用小波基表示,压缩测量采用随机高斯矩阵,重构算法是omp重构(Compressed sensing, sparse representation using wavelet representation, compression measurements using random Gaussian matrix remodeling reconstruction algorithm is omp)
    2013-10-17 12:51:03下载
    积分:1
  • color_bar
    彩条产生程序。。。。720p需添加74.25M时钟(colorbar generation. need 74.25mhz clock if 720p gen)
    2020-06-22 06:20:01下载
    积分:1
  • zhangwen
    说明:  掌纹识别palm print recognition software(gray processing, image filtering, detection angle HARRIS, wavelet decomposition. Heat extraction zone, the function of mathematical ecology )(Palmprint identification palm print recognition software (gray processing, image filtering, detection angle HARRIS, wavelet decomposition. Heat extraction zone, the function of mathematical ecology))
    2008-10-28 16:57:12下载
    积分:1
  • minimum-spanning-tree
    在一个具有几个顶点的连通图G中,如果存在子图G 包含G中所有顶点和一部分边,且不形成回路,则称G 为图G的生成树,代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
    2013-08-23 23:06:57下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载