-
houghline.m
对读入的图片做霍夫变换,识别出图片中的直线并输出。(Do the Hough Transform to the input image, that is to detect lines in the input image, and output those lines.)
- 2009-11-24 13:11:28下载
- 积分:1
-
bpass
It will the user to plot various graph with different x and y notations
- 2013-04-04 09:34:35下载
- 积分:1
-
mobile-position
本程序是移动协作定位算法的仿真程序,各种条件下的代码都有,可以直接运行。(This progrem is a mobile cooperative localization algorithm, various conditions have the code, can be directly run.)
- 2013-04-04 12:16:13下载
- 积分:1
-
VEP
vep的编写,很好的语音问题处理结果。希望对你有用(program the vep,it has a good effect.i wish it is helpful for you)
- 2011-12-06 10:49:42下载
- 积分:1
-
COE466LAB1.m.tar
A data classifiction matlab script
- 2012-11-30 08:03:23下载
- 积分:1
-
K-meanCluster
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
- 2007-11-15 01:49:03下载
- 积分:1
-
ACMsnakes
This program proveides a solution by Ghassan Hamarneh for detection curves using ACTIVE CONTOUR MODELS
- 2009-04-02 19:30:32下载
- 积分:1
-
GyhLmsTest2
自适应噪声抵消程序,归一化的最小均方算法,适用于核磁共振数据(Adaptive noise cancellation procedure, normalized least mean square algorithm is applied to NMR data)
- 2010-01-27 14:19:49下载
- 积分:1
-
example07_07
说明: Matlab数理统计方面的图书源码,方差分析希望对您有用(some resource with matlab )
- 2011-03-27 15:42:11下载
- 积分:1
-
DDEServerSample
DDE服务器编写例程,实用DDEML类库实现,简单易用。(DDE server to prepare routines, practical implementation DDEML class, easy to use.)
- 2009-03-03 19:57:51下载
- 积分:1