-
dijkstra_pt
迪特斯特拉算法 给初学者用 大家互相学习学习(Dieter Stella algorithm for beginners to learn with us learn from each other)
- 2011-04-24 09:28:18下载
- 积分：1
-
convmat
一种把原始数据转换为矩阵形式，并且把数据分成训练与测试，按频率转换的一个小程序。(a kind of conversion of the original data matrix form, and data into training and testing, Frequency conversion by a small procedure.)
- 2007-03-17 22:29:11下载
- 积分：1
-
gblSolve
介绍了gblSolve独立版本的使用示例，并给出了完整的Matlab代码。(an example of the use of the stand-alone version gblSolve is described and the full Matlab code is given.)
- 2020-11-13 10:19:43下载
- 积分：1
-
GMM_test1
This file is for GMM TEST
- 2010-08-06 17:02:38下载
- 积分：1
-
MYWARMA
MYW - ARMA 算法的MATLAB代码, 是频谱分析(通常是在高级DSP这门课中会用到的)的常用算法(MYW- ARMA algorithm MATLAB code, Analysis of the spectrum (usually at the senior DSP This class will be used) to the commonly used algorithm)
- 2007-03-30 00:29:09下载
- 积分：1
-
Implementation-and-Evaluation-of-NIST-Biometric-I
IN THIS WE ARE ABLE TO ANALYZE Implementation and Evaluation of NIST Bio-metric Image Software for Fingerprint Recognition.zip
- 2012-06-06 16:03:02下载
- 积分：1
-
PCM-A13
讲述PCM及13折线A率编码与解码的概念，随机给出一个语音信号，并用A率13折线的方法matlab编程对其编码与译码
(About the concept of PCM and 13 line-rate encoding and decoding A randomly given a voice signal and a line with a rate of 13 A method of encoding and decoding matlab programming for its)
- 2013-12-10 12:28:08下载
- 积分：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
-
FDTD3D_UPML1_OP
help me to help another
- 2011-04-29 02:52:32下载
- 积分：1
-
shock_filters
三种冲击滤波器的matlab实现与比较：Comparing 3 shock filters: Osher-Rudin [OR90], Alvarez-Mazorra [AM94] and Gilboa-Sochen-Zeevi [GSZ02eccv,GSZ04pami]. (three shocks Filter Implementation of Matlab and comparison : Comparing three shock filters : Osher- RUDIN [OR90] Alvarez-Mazorra [AM94] and Gilboa-Sochen- Ze Plav [GSZ02eccv, GSZ04pami].)
- 2021-04-21 21:28:49下载
- 积分：1
