登录
首页 » Windows_Unix » pca_w

pca_w

于 2009-11-05 发布 文件大小:1KB
0 259
下载积分: 1 下载次数: 9

代码说明:

  matlab的PCA变换的程序,实现图像数据的PCA变换(PCA translate)

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

发表评论

0 个回复

  • spll
    用于公司锁相环程序,已经通过样机验证,需要的朋友请下载(Phase-locked loop procedure used in the company, has been through prototype validation, need friends please download)
    2012-12-31 13:07:32下载
    积分:1
  • chaoliujisuan
    基于牛顿拉夫逊法的潮流计算程序源代码,有例子(Newton Raphson method based on the trend of computer program source code, there are examples)
    2011-06-02 12:03:11下载
    积分:1
  • dvr-
    DVR- suitable for beginners with matlab mdl
    2013-12-04 02:09:13下载
    积分:1
  • keshe1
    通信系统的设计,课程实际做的,有编码、调制解调等等部分构成,简单,但一定出结果(the design of communication system)
    2015-04-06 14:46:51下载
    积分:1
  • MIMO-OFDM-OFM
    MIMO-OFDM-OFM 无线通信 (英文版)书内程序(MIMO- OFDM- OFM wireless communication (English) within the program)
    2014-12-03 17:38:11下载
    积分:1
  • target-tracking-using-kalman
    matlab编写的用卡尔曼滤波实现目标跟踪(matlab prepared using Kalman filter tracking)
    2013-10-17 15:49:05下载
    积分:1
  • abc
    file of show how to implement the tecnical ABC in antenna microstrip
    2015-04-01 12:12:20下载
    积分:1
  • disper_compens
    Matlab code for dispersion compensation
    2012-01-31 04:44:35下载
    积分:1
  • annealing
    说明:  模糊pid控制程序,控制系统整体框架的搭建(Fuzzy pid control procedures, the overall framework of control system structures)
    2009-07-23 19:46:54下载
    积分:1
  • NewK-means-clustering-algorithm
    说明:  珍藏版,可实现,新K均值聚类算法,分为如下几个步骤: 一、初始化聚类中心 1、根据具体问题,凭经验从样本集中选出C个比较合适的样本作为初始聚类中心。 2、用前C个样本作为初始聚类中心。 3、将全部样本随机地分成C类,计算每类的样本均值,将样本均值作为初始聚类中心。 二、初始聚类 1、按就近原则将样本归入各聚类中心所代表的类中。 2、取一样本,将其归入与其最近的聚类中心的那一类中,重新计算样本均值,更新聚类中心。然后取下一样本,重复操作,直至所有样本归入相应类中。 三、判断聚类是否合理 采用误差平方和准则函数判断聚类是否合理,不合理则修改分类。循环进行判断、修改直至达到算法终止条件。(NewK-means clustering algorithm ,Divided into the following several steps: A, initialize clustering center 1, according to the specific problems, from samples with experience selected C a more appropriate focus the sample as the initial clustering center. 2, with former C a sample as the initial clustering center. 3, will all samples randomly divided into C, calculate the sample mean, each the sample mean as the initial clustering center. Second, initial clustering 1, according to the sample into the nearest principle clustering center represents the class. 2, as this, take the its recent as clustering center of that category, recount the sample mean, update clustering center. And then taking off, as this, repeated operation until all samples into the corresponding class. Three, judge clustering is reasonable Adopt error squares principles function cluster analysis.after clustering whether reasonable, no reasonable criterion revisio)
    2011-04-06 20:45:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载