inpainting

战胜matlab必做的50题，本书以单元练习的形式，从matlab最基本的问题入手，循序渐进，逐渐过渡到复杂的数学问题，信号分析问题等(Matlab will do over 50 items, book element in the form of exercises, from the most basic problem matlab start, step by step, gradually transition to complex mathematical problems, signal problems)

支持向量机的研究现已成为机器学习领域中的研究热点，其理论基础是Vapnik[3]等提出的统计学习理论。统计学习理论采用结构风险最小化准则，在最小化样本点误差的同时，缩小模型泛化误差的上界，即最小化模型的结构风险，从而提高了模型的泛化能力，这一优点在小样本学习中更为突出。SVM理论正是在这一基础上发展而来的，经过十几年的研究和发展，已开始逐步应用于一些领域。在解决小样本、非线性及高维模式识别问题中表现出许多特有的优势，已经在模式识别、函数逼近和概率密度估计等方面取得了良好的效果。( Support Vector Machine (SVM) is a new machine learning technique in recent years developed based on statistical learning theory (SLT). It wins popularity due to many attractive features and emphatically performance in the fields of nonlinear and high dimensional pattern recognition. The theory and algorithm of SVC is studied at first, then, simulation is to recognize handwritten numeral with the Lib-SVM toolbox. At last, we study the result, which shows that the SVC can do the classification problem with good performance, shorter operation time and is more suitable for real-time implementation.)

可以实现多智能体编队，即多个分散智能体聚集到一块且相互之间保持一定的距离向前运动(Can achieve multi-agent formations that gathered more than a dispersion agent, and maintain a certain distance from each other moving forward)

说明：  对数字车牌的识别，详细揭示了过程，并提供了实验报告。(Digital license plate recognition, in detail reveals the process and provide an experimental report.)

turbo码在simulink中的编译码、误码率分析的仿真。(the encoding and decoding of turbo codes in the simulink simulation, bit error rate analysis.)

CA码发生器gold码可作为gps仿真的信号发生器(generate ca code)

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成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.)

The signal some times should be smoothed in planned way before submitting it to environment where now widely used algorithm is LMS

Histogram Equalization MAtlab Code for image contrast Enhancement without using inbuilt function

灰色系统改进累加预测 通过改变矩阵x实现不同原序列的灰色系统预测,nn表示预测个数(Gray predicted cumulative improvement achieved by changing the matrix of x different of the original sequence by Grey System Theory, nn predict that the number of)