登录
首页 » PDF » 5pcnn-segmentation

5pcnn-segmentation

于 2014-11-19 发布 文件大小:724KB
0 241
下载积分: 1 下载次数: 1

代码说明:

  with simplified pulse coupled neural network for image binary segmentation of surveying and mapping science and technology papers

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

发表评论

0 个回复

  • work
    QR factorization of an m × n matrix A with m ≥ n is a pair of matrices A = QR
    2009-06-01 02:40:00下载
    积分:1
  • eemdd
    经验模式分解改进代码,基于经验模式分解的一种改进 经验模式分解 matlab(Empirical Mode Decomposition improve code)
    2013-09-22 09:56:17下载
    积分:1
  • 无约束
    说明:  matlab 无约束MPC代码 实现无约束MPC控制(unconstraint MPC code)
    2019-06-06 11:38:08下载
    积分:1
  • SataliteLink16QAM
    16 Quam modulation and link budget calulation for SATCOM
    2011-07-29 02:59:20下载
    积分:1
  • maokei_v72
    有信道编码,调制,信道估计等,包括最小二乘法、SVM、神经网络、1_k近邻法,通过matlab代码。( Channel coding, modulation, channel estimation, Including the least squares method, the SVM, neural networks, 1 _k neighbor method, By matlab code.)
    2020-12-17 15:29:12下载
    积分:1
  • thresholdOtsu
    大津法实现,将灰度图像二值化,便于图像的后续处理。(Binary image dajin method )
    2011-06-22 23:09:44下载
    积分:1
  • Hamming
    说明:  汉明码(Hamming Code)是汉明于1949年的一种能纠正单个错误的线性分组码,最小码距dmin=3。汉明码的实现方式是在原数据中插入m位作为校验位。对于(n,k)汉明码,编码时需满足以下原则(Hamming code is a kind of linear block code which can correct single error in 1949. The minimum code distance Dmin = 3. The implementation of Hamming code is to insert m bit into the original data as check bit. For (n, K) Hamming codes, the following principles should be met)
    2021-04-28 17:48:43下载
    积分:1
  • f1eb128d
    说明:  路径规划算法,适用于多机器人路径规划学习(Path planning algorithm is suitable for multi robot path planning learning)
    2021-01-30 11:26:15下载
    积分:1
  • motioncompensation
    一种带有摄像机抖动的背景建模方法,使用张量分解和仿射变换,需要张量工具箱的支持。(a background estimation method with dynamic change,using tensor factorization and affine transform)
    2013-05-06 19:11:34下载
    积分:1
  • PLSI
    利用PLSI算法自动对一个文档集进行聚类,需要调节聚类的维度K值,从而得到最大的likelihood(PLSI automatically using an algorithm for clustering document set needs to be adjusted to the dimension value of K clusters, to obtain the maximum likelihood)
    2014-01-06 13:55:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载