登录
首页 » matlab » VIPeR.v1.0

VIPeR.v1.0

于 2013-04-01 发布 文件大小:19294KB
0 285
下载积分: 1 下载次数: 41

代码说明:

  Gait recognition is a new field of biometrics. The deployment of gait is more realistic as a part of a multi modal biometric system (e.g. combination of gait and face together)

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

发表评论

0 个回复

  • xunhuanpu
    一个用循环谱原理给出的计算程序,可以画出信号的图形(a cyclic spectrum )
    2009-11-29 23:36:45下载
    积分:1
  • channelcode
    有关信道编码的word文档,内容很详细,(Channel coding the word about the document, the content is very detailed,)
    2010-12-30 14:11:19下载
    积分:1
  • Manual-for-Matlab-toolbox-EKFUKF
    matlab ekf and ukf manual,讲解的很详细,很有参考价值(matlab ekf and ukf manual)
    2011-01-23 19:01:03下载
    积分:1
  • ofdm_fading_new
    在高斯与一径瑞利衰落信道下对OFDM系统(QPSK调制)的功率普的仿真(in Gaussian with a Rayleigh fading channel right OFDM system (QPSK) Pu Power Simulation)
    2007-05-27 00:27:38下载
    积分:1
  • canny
    canny算子,matlab环境,分模块编程,解释详尽(canny operator matlab environment, sub-module programming, explain the detailed)
    2013-04-11 13:20:24下载
    积分:1
  • bfilter2
    BFILTER2 Two dimensional bilateral filtering. This function implements 2-D bilateral filtering using the method outlined in: C. Tomasi and R. Manduchi. Bilateral Filtering for Gray and Color Images. In Proceedings of the IEEE International Conference on Computer Vision, 1998.
    2014-01-28 16:36:36下载
    积分:1
  • RADAR--system-simulation
    雷达系统仿真,能更方便的仿真杂波干扰对系统的影响,希望有所帮助(Radar system simulation, the simulation can be more convenient clutter impact on the system, I hope to help)
    2014-06-21 09:15:01下载
    积分:1
  • tezhengtiqu
    此程序简单实用,用于数据的特征提取。选取了波形因子、峭度、频段带能量百分比等时域频域特征量。(This procedure is simple and practical, for data feature extraction. Select form factor, kurtosis, band band energy percentage frequency domain characteristics.)
    2013-05-15 18:57:49下载
    积分:1
  • pid_nn
    单神经元PID simulink建模。被控对象是DC-DC.(failed to translate)
    2009-11-19 21:54:58下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载