complex--small-world

说明：  效果不錯的車牌辨識系統 適合初學者觀看~(Good results of license plate recognition system for beginners watch ~)

说明：  Grtzl算法计算dft的matlab程序和lms算法的自适应窄带滤波的程序。(Dft algorithm Grtzl the lms algorithm matlab procedures and narrow-band adaptive filtering process.)

建模用函数，专门为准备数学建模的同学学习参看的源代码。(Modeling with function, specifically in preparation for the mathematical modeling of students learning to see the source code.)

COlor Histogram Computation

将压缩感知用于谱估计中，根据论文谱压缩感知的一些程序(Compressive sensing (CS) is a new approach to simultaneous sensing and compression of sparse and compressible signals based on randomized dimensionality reduction. To recover a signal from its compressive measurements, standard CS algorithms seek the sparsest signal in some discrete basis or frame that agrees with the measurements. A great many applications feature smooth or modulated signals that are frequency sparse and can be modeled as a superposition of a small number of sinusoids. Unfortunately, such signals are only sparse in the discrete Fourier transform (DFT) domain when the sinusoid frequencies live precisely at the center of the DFT bins. When this is not the case, CS recovery performance degrades significantly. In this paper, we introduce a suite of spectral CS (SCS) recovery algorithms for arbitrary frequency sparse signals. The key ingredients are an over-sampled DFT frame, a signal model that inhibits closely spaced sinusoids, and classical sinusoid parameter e)

iRobotCreateSimulatorToolbox1_3 iRobot仿真matlab工具箱(iRobotCreateSimulatorToolbox1_3 iRobot simulation matlab toolbox)

MATLAB环境下的BP网络的实现，源程序，对于在matlab下做神经网络仿真的各位有帮助。(MATLAB environment BP network realized, source files, For Matlab neural network simulation do you have any help.)

说明：  QPSK（四进制相移键控）信号调制解调过程（经高斯信道）的仿真(QPSK (quaternary phase shift keying) signal modulation and demodulation process (by the Gaussian channel) of the simulation)

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)

自己实现的，模糊C均值聚类的代码，在K-mean上添加了隶属度矩阵。注释详细，方便理解算法步骤(my implementation, Fuzzy C-Means clustering code in the K-mean adding a membership matrix. Notes detailed, easy to understand algorithm steps)