搜索资源列表
Automatic_Fingerprint_Authentication_System
- A novel texture-based Automatic Fingerprint Authentication System (AFAS) is proposed. A fingerprint image is preprocessed to enhance the image by Short Time Fourier Transform (STFT) analysis. Then, three sets of invarian
2DLDA_PK_LDA_for_feature_extraction
- These are the codes in "A note on two-dimensional linear discrimant analysis", Pattern Recognition Letter In this paper, we show that the discriminant power of two-dimensional discriminant analysis is not stronger tha
zuiyou
- 用一观测器从t=1秒开始对一个运动目标的距离进行连续地跟踪测量,假设观测的间隔为一秒钟,雷达到运动目标之间的距离为S(t)(1) 统计特性的初值为 (2)观测误差是与和均不相关的白噪声序列,并且有 (3)观测数据存放在附加的文件中(单位:m)。 要求:分析上述对象,建立系统模型,构造卡尔曼滤波器,编程计算,求: (1) 距离S(t)的最佳估计及估计误差, (2) 距离S(t-5)的最佳平滑及估计误差
knn
- knn k近邻算法,可选择欧式距离或者曼哈顿距离-knn k nearest neighbor, Euclidean distance or Manhattan can choose the distance
11111111
- 该判断多边形点时钟排列方向, 非常准确(不准确的还没有遇到过,快3年了)。 该函数用到的相关函数都在文档中: 1.PtoLDistance-点到直线的距离; 2.CalcPolygonRect-计算多边形外接矩形; 3.CalcSegmentRect-计算线段外接矩形; 4.Distance-计算两点距离; 5.ISZEROA-判断数值是否为零; 该函数数据类型为Windows的POINT,使用了标准模板
FreeForm_Register2D_source_Aug0107
- The C++ implementation of the latest 2D shape registration algorithm. Based on distance transform of the original shapes.
DVcode
- VC环境下编译的网络层路由Distance Vector算法,可自行输入节点数,算出路径。-VC environment to compile the network layer routing Distance Vector algorithm, nodes are free to enter, calculate the path.
DValgorithm
- DV算法的C语言实现。用于网络的网络层距离向量选路。-DV Algorithm C language. The network layer for network distance vector routing.
EditDistance
- 用动态规划算法思想求最小编辑距离,即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
mopsowithcd
- 一种计算全局拥挤距离多目标优化粒子群算法源程序,这是一个C语言编制的源程序,很实用.-A calculation of the overall crowding distance of multi-objective particle swarm optimization algorithm source code, which is a C language source program, it is practical.
DisTrans
- 快速算法,可以快速计算一个二进制图片的Euclidean距离。-Fast algorithm can quickly calculate a binary image of the Euclidean distance.
patternClass
- 產生k個d維的常態分布樣本,產生某個事前機率為P(wi)的常態分布的discriminant function,計算任兩點間的Euclidean distance及Mahalanobis distance -Generated k-d-dimensional normal distribution of samples to generate a prior probability P (wi) of the normal d
fangxian
- 反算坐标 求得距离及方位角,根据算得数据利用全站仪进行放线-Inverse distance and azimuth coordinates obtained, according to the data can be carried out using total station Actinomycetes
router
- 这个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm, the use of java programming.
string
- 求字符串编辑距离 动态规划 设给定样本 ,样本P在文本T中的K-近似匹配(K-approximate match)是指P在T中包含最多K个差异的匹配,求K-For the string edit distance to the set of dynamic programming based sample, the sample P in the text T in the K-approximate match (K-approxim
StringMatch
- 字符串匹配问题中求最小编辑距离的源码,精简实用,是作业的好帮手!-String matching problem in order to minimize the distance of the source editor to streamline the utility is operating a good helper!
distanceVectorRouter(c)
- 利用距离向量算法更新路由表。 该程序的多个实例(进程或线程)可以以运行在一台机器 一个实例代表一个路由器(结点)。 实例之间利用UDP交换路由表。 能够打印出邻居列表和输出路由表!(c语言实现)-The use of distance vector algorithm to update the routing table. Multiple instances of the program (process or
disteusq
- calculates the squared euclidean distance between all pairs of rows of two matrices. -calculates the squared euclidean distance between all pairs of rows of two matrices.
GSNNSimulation
- 本文针对SLAM算法中数据关联过程,提出了一种简单易行的改进方法,将欧氏距离与马氏距离结合用于数据关联。算法不必计算地图所有特征与所有量测之间的马氏距离,而是首先利用相对简单的欧氏距离计算缩小了待关联特征的搜寻范围。利用人工合成数据的仿真结果表明,改进后的数据关联方法可以大幅减少系统计算量,提高关联效率,且不会造成错误关联的增加。-This article SLAM algorithm for data association proc
ff
- 基于距离变换的多尺度连通骨架算法,本文提出一种新型骨架算法 ,在图形内根据距 离变换的约束 ,由骨架种子点开始以单像素宽度逐点生长出各骨架分支 ,逐点生长保证了连通性.实验证明该算法 的骨架生长过程是骨架由粗到精的演变过程 ,能够方便地实现骨架的多尺度控制.-Distance transform based on multi-scale skeleton connectivity algorithm, this paper pr