-
Corner_Matching_by_Invariant_Moments
Corner_Matching_by_Invariant_Moments.rar
INDEX:
1- InvariantMomentsofCorners.m
Calculate moment invariants on the selected window of the corner.
2- invariantmoments.m
Calculates Moment invariants
- 2009-09-25 22:07:55下载
- 积分:1
-
DS_kuopin_simulation
说明: 通过Monte Carlo仿真,说明DS扩频信号在抑制正弦干扰方面的有效性。用一均匀随机数发生器产生某个二进制信息符号的序列,每个信息比特重复Lc次。
包含文件:DS_restrain_interference.M
SS.M(through Monte Carlo simulation, note DS spread spectrum signal sinusoidal interference in inhibiting the effectiveness. Using a uniform random number generator produce a binary sequence information symbols, each bit of information to repeat Lc times. Documents include : DS_restrain_interference.M SS.M)
- 2006-03-22 11:32:53下载
- 积分:1
-
GMx
灰色线性组合模型算法,可以实现该算法的建模,拟合以及预测(Grey linear combination model algorithm, the algorithm can be implemented for modeling, fitting and forecasting)
- 2013-11-01 17:36:20下载
- 积分:1
-
alphatrimmedmedian
alpha trimmed median filter for image
- 2015-02-20 17:59:26下载
- 积分:1
-
theoreticalplate
说明: 一个用于计算精馏塔理论塔板的小程序,可以实现图示化.(a theory used in the calculation of distillation tray of small procedures, can achieve Graphic.)
- 2006-03-22 14:15:30下载
- 积分:1
-
training
trainig neural networks
- 2014-11-21 19:34:58下载
- 积分:1
-
shengyuxuanlizi
通信系统仿真原理及其应用第五章升余弦例子(Principles of Communication System Simulation and its application Chapter V examples Raised Cosine)
- 2009-03-11 15:45:18下载
- 积分:1
-
cdt2000-all
这是一个不错的资料是关于cdt2000模块的资料可以通过资料查询很多关于这个模块的知识(This is a good information regarding cdt2000 module information through data queries can be a lot of knowledge on this module)
- 2010-02-02 18:08:25下载
- 积分:1
-
GMM
高斯混合模型——GMM的算法,属于大数据量的数据处理(failed to translate)
- 2013-05-04 01:06:11下载
- 积分:1
-
BruteSearch
K-nearest neighbors 搜索 聚类时经常使用的一种方法 国外网站转载( The following utilities are provided:
- Nearest neighbor
- K-Nearest neighbors
- Radius Search
They al supports N-dimensions and work on double, it is possible to choose if return the distances.
Here is a time comparison with a vectrized m-code:
N=1000000 number of reference points
Nq=100 number of query points
dim=3 dimension of points
k=3 number of neighbor
tic
[idc,dist]=BruteSearchMex(p ,qp , k ,k) MEX
toc
tic
[idc,dist]=knnsearch(qp,p,k) VECTORIZED M-CODE
toc
p=rand(N,dim)
qp=rand(Nq,dim)
Output:
Elapsed time is 0.962640 seconds.
Elapsed time is 18.813100 seconds. )
- 2009-03-30 08:08:08下载
- 积分:1