登录
首页 » matlab » MATLAB-fingerprinit-Demo

MATLAB-fingerprinit-Demo

于 2013-09-11 发布 文件大小:196KB
0 212
下载积分: 1 下载次数: 7

代码说明:

  指纹识别预处理.细线化处理,C++翻译过来MATLAB坐仿真处理,适合初学者学习(fingerprint matching)

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

发表评论

0 个回复

  • LMMSE_constellation
    线性最小均方误差估计,估计恢复出的信号星座图(The linear minimum mean square error estimation,Estimation of LMMSE signal constellation restoration)
    2013-01-20 12:03:38下载
    积分:1
  • Introduction-to-Simulink-
    matlab的Simulink仿真实例,原版英文资料,比较基础。(Matlab Simulink simulation instance, the original information in English, the basis for comparison.)
    2013-04-07 09:49:14下载
    积分:1
  • q21
    this code is about mlp 1 layer neural network with back propagation training algorithm by using geradient descence for nonlinear system. input data are random.
    2013-11-28 02:51:57下载
    积分:1
  • WpfApplication14
    这是一个展示Binding功能的例子,实现了滑动条控制矩形坐标的功能。(This is a showcase Binding features examples slider control to achieve a rectangular coordinate functions.)
    2013-11-10 14:34:10下载
    积分:1
  • zonalReconstruction
    Zonal reconstruction Shack-Hartmann wavefront sensor
    2016-11-07 19:16:51下载
    积分:1
  • shengxuezhenliedingxiangjingdufenxi
    两种声学阵列的定两种声学阵列的定向精度分析与仿真向精度分析与仿真(Two acoustic arrays of two sets of directional acoustic array analysis and simulation accuracy to the accuracy of analysis and simulation)
    2008-03-17 21:42:23下载
    积分:1
  • fhp
    利用格子气元胞自动机模拟流体的matlab源码(matlab code for simulating fluid flow using Lattice Gas Cellullar Automata)
    2009-12-06 17:41:39下载
    积分:1
  • matrix
    this is used for adding matrix
    2011-01-26 03:31:40下载
    积分:1
  • EOF
    matlab的eof程序,比较好用,而且说明清晰,希望对大家有用(program to do EOF analysis, and scale the EOFs. This is an example of scaling EOFs)
    2012-04-27 00:18:18下载
    积分:1
  • knn1
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2017-08-09 21:06:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载