MATLAB_gui

Gabor滤波器的纹理特征提取 具有很不错的性能 比较基础 (Gabor filter texture feature extraction)

The toolbox provides functions to: - encode dual quaternions: a point position, velocity, a line position, velocity, a rotation, a translation, a screw,... - do operations on dual quaternions: the dual quaternion multiplication, the dual quaternion conjugates, the inverse,... - retrieve parameters from a dual quaternion: finding the parameters of a rotation dual quaternion, or a screw dual quaternion,... - easily going back and forth between Fick rotation coordinates, 3*3 rotation matrices, rotation dual quaternions, angular vector

一个自己编写的Tri-training算法，利用支持向量机，K近邻，和朴素贝叶斯进行协同训练(A imagecut.rar Tri-training algorithm, using support vector machine, K neighbor, and simple bayesian for collaborative training)

基于matlab的指纹识别，自动识别指纹库中的指纹，使用简单正确率高。(Matlab based on fingerprint recognition, automated fingerprint identification fingerprint , simple to use correct rate.)

ADS1282内噪音测试程序，用DSP读取数据，再用MATLAB解析数据并且分析(a code for ADS1282 noise test)

说明：  最坏情况鲁棒自适应波束形成优化。实际应用中,由于阵元位置的细微偏差、阵元之间的幅度相位响应也不可能完全相同、以及有限采样效应等因素,使得实际的方向矢量与其理想值之间存在误差,严重影响了波束的性能。针对这一问题，论文作者在最坏情况下自适应波束形成方法进行研究，并作比较。(Worst case robust adaptive beamforming optimization. In practical applications, the errors between the actual direction vector and its ideal value are caused by the slight deviation of the element position, the impossibility of identical amplitude and phase responses between the elements, and the limited sampling effect, which seriously affects the performance of the beam. In order to solve this problem, the author of this paper studies and compares the adaptive beamforming methods in the worst case.)

介绍了《MATLAB语言常用算法程序集》一书的源程序(" MATLAB language commonly used algorithm for assembly," the source book)

code for shedule extraction

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

光滑比的检验，用于灰色预测模型的建立过程，如果数据达不到要求，就不能用来预测(to exam it whether smooth or not)