登录
首页 » matlab » tnn7_code_201212141110

tnn7_code_201212141110

于 2013-11-28 发布 文件大小:63KB
0 202
下载积分: 1 下载次数: 4

代码说明:

  REAL-TIME FACE DETECTION AND TRACKING

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

发表评论

0 个回复

  • sixteen5
    基于matlab编写的基本的M序列和gold序列的生成,作为其他伪随机码生成的基础。对于初学者很有帮助的(Prepared based on matlab basic sequence of M sequence and the generation of gold, as other pseudo-random code generated basis. Very helpful for beginners)
    2011-04-21 20:22:22下载
    积分:1
  • KmeansaKNN
    attached file contain two algorithm for classification.K_means and K Nearest Neiborhood. and related m_filles in matlab
    2011-05-08 19:32:27下载
    积分:1
  • D-MESONS
    求解Ds粒子衰变的手征修正参数,涉及多目标的最优化。(Chiral symmetry-breaking parameters to Ds mesons)
    2013-08-12 23:57:06下载
    积分:1
  • m10_9
    一维自组织特征映射网络对输入向量空间进行识别分类(One-dimensional self-organizing feature map network input vector space to identify categories)
    2009-03-12 11:25:27下载
    积分:1
  • EqVsIFFT
    DVB-T 2K signal generation Eq. (2.1.4) vs. 2N-IFFT.DVB-T 2K 信号发生器matlab源代码。(DVB-T 2K signal generation Eq. (2.1.4) vs. 2N-IFFT.DVB-T 2K signal generator matlab source code.)
    2008-05-15 13:58:03下载
    积分:1
  • DWT
    ThreeLevelDWT. it explain different level and ycrcb
    2011-10-17 17:34:30下载
    积分:1
  • FFA
    FFA(快速折叠算法),实现噪声中的周期信号检测,及周期估算(FFA (fast folding algorithm), the realization of the periodic signal in noise detection, and cycle estimates)
    2009-05-01 10:22:51下载
    积分:1
  • lle
    用LLE算法来实现高维空间中流行的降维,从而在低位空间中有效表示该流行(to decrease the dimension of manifold embedded in high dimension space )
    2013-12-01 17:01:19下载
    积分:1
  • LGPowerXB
    涡旋光束,幂指数涡旋光束,新型光束,捕获粒子,特殊光学(Vortex beams, exponential vortex beams, the new beam, trapped particles, special optical)
    2015-09-06 12:54:14下载
    积分:1
  • 101259363Desktop
    传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
    2017-07-18 12:05:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载