Intervalodetempocorrigido

字符识别、K-L人脸识别、虹膜识别、笔画识别等模式识别的例程和资料。(Character recognition, KL face recognition, iris recognition, stroke recognition, pattern recognition routines and information.)

1.分别在两个图中画出δ(n)和δ(n-2)，其中-10≤n≤10，画出U（n）其中-10≤n≤10。 2.分别在两个图中画出x1(n)=cos(2π×20×0.01×n)，0≤n≤10和x2(n)=(0.8)n，1≤n≤6。 3.由上一题，计算y(n)=x1(n)+x2(n)，并画图。(1. Draw the figure at two δ (n) and δ (n-2), where-10 ≤ n ≤ 10, draw the U (n) where-10 ≤ n ≤ 10. 2. Respectively in the two Draw the figure x1 (n) = cos (2π × 20 × 0.01 × n), 0 ≤ n ≤ 10 and x2 (n) = (0.8) n, 1 ≤ n ≤ 6. 3. from the previous question, calculate y (n) = x1 (n)+ x2 (n), and drawing.)

PHD谐波分解，大家可以尝试下，希望对大家有所帮助(PHD harmonic decomposition, we can try, we hope to help)

数字信号处理 语音处理与分析 与识别 dsp MATLA(DSP MATLB)

5/1/2012 - updated to implement extended Golay codes for stanag

带有原二进制信号与BPSK调制后的信号图对比的BPSK仿真程序(With the original binary signal and BPSK modulation signal comparison of BPSK simulation program)

matlab 例程，很简单的且很容易理解的k-medoids聚类算法源代码(matlab routines, very simple and very easy to understand k-medoids clustering algorithm source code)

arc length :arclength: compute arc length of a space curve, or any curve represented as a sequence of points...

这是图像处理中的车牌检测，是用matlab编写实现的。(This is the license plate detection, image processing is achieved using matlab.)

字典树的基本功能是用来查询某个单词（前缀）在所有单词中出现次数的一种数据结构，它的插入和查询复杂度都为O(len),Len为单词（前缀）长度，但是它的空间复杂度却非常高，如果字符集是26个字母，那每个节点的度就有26个，典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)