nonlinear_draw

This MATLAB code performs image deconvolution.

matlab6.5图形图像处理源程序 matlab6.5图形图像处理源程序(matlab6.5 Graphics and Image Processing source)

神经网络的结构选4-5-3，学习速率为0.28，惯性系数为0.04，加权系数初始值取-0.5-0.5上的随机数。(4-5-3 neural network structure selection, the learning rate is 0.28, the inertia coefficient is 0.04, the initial value of weighting factor to take-0.5-0.5 the random number.)

正交匹配追踪法实现1-D信号压缩传感，测量数M>=K*log(N/K),K是稀疏度,N信号长度,可以近乎完全重构(Orthogonal Matching Pursuit)

变分模态分解,用于分解各种信号，可用来故障诊断，特征提取。(Variational mode decomposition, used to decompose various signals, can be used for fault diagnosis and feature extraction.)

对录音信号集 中的某一语音，利用BATLAB设计一美尔例谱算法，并实现。 取信号集 中的一个语音信号：“xxxxxx”，将它作为输入的语音信号来为设计一个美尔倒谱算法，在该算法中，主要设计了以下环节： 1.读入一个语音信号；2.对这个信号归一化；3.对归一化的信号进行加窗处理（这里的矩形窗长度必须为257，重帧长64）；4.进行预加重处理，即通过一个高通滤波器： ；5进行512点的FFT；6.分别取模平方得到功率谱；7.在设计的mel滤波器组中，我采用了25个带通滤波器；8.将得到的功率谱信号通过mel滤波器组，得到相应的25个功率值；9.对这些功率值取自然对数；10.对这些值取离散作弦变换；11.将得到的值去掉直流分量，取其它值作为MFCC参数。 (Concentrated on recording a voice signal, using BATLAB designed Mayer cases spectral algorithm, and implementation. Get a voice signal signal focus: "xxxxxx", will it as input for the design of a voice signal to Mel Cepstrum algorithm in the algorithm, the main design of the following links: 1. Read a speech signal 2. On the signal normalized 3. Of the normalized windowed signal processing (here, rectangular window length must be 257, re-frame size 64) 4. For Pre-emphasis processing through a high-pass filter: 5 for 512 points of FFT 6. modulo square were obtained spectrum 7. in the design of mel filter banks, I use a 25 band-pass filter 8 . will be the power spectrum signal by mel filter bank, corresponding to the 25 power values 9. on the power to take the natural logarithm value 10. to take these values as strings of discrete transform 11. will be of value to out DC component, to take other values as MFCC parameters.)

programme programme

MATLAB的语言常用算法程序集 比较适合初学者学习(MATLAB language commonly used algorithm for assembly More suitable for beginners to learn)

节点总数目N； 平均连接度α 边的平均长度β 两点间长度d(i,j) 节点间最长的边的长度L 两点的连接概率p(i,j) (The total number of nodes N average connectivity α β average length sides between two points length d (i, j) between nodes longest side length L connecting two points of the probability p (i, j) )

Yen 算法求解最短路径 附加测试代码 例程(Yen shortest path algorithm)