一次基于神经网络的人脸识别matlab开发代码

说明：  基于DCE-MRI建立动脉输入方程检测乳腺癌(Dynamic Contrast-Enhanced MRI Using Gd-DTPA_Interindividual Variability of the Arterial Input Function and Consequences for the Assessment of Kinetics in Tumors)

matlab遗传算法程序，共13个，每个程序内部都带有中文说明，简单易懂。(matlab genetic algorithm, a total of 13, within each program with Chinese instructions, easy to understand.)

使用立方b样条小波的均值插值。使用立方b样条小波的细分插值。(Average interpolation using cubic B-spline wavelet.Subdivision interpolation using cubic B-spline wavelet.)

bch编解码的完整版，本人已经做过fpga实现，就是按照该程序为原型，绝对可运行(bch decoding the full version, I have done fpga implementation is in accordance with the procedure for the prototype, can certainly run)

可以通过画出傅里叶级数圆的动画，帮助加深对傅里叶级数的理解，并且有详细的注释。(By drawing the Fourier series circle animation, we can help deepen the understanding of Fourier series, and have detailed annotations.)

说明：  大部分ADRC元素，simulink仿真复现，可替换参数。(Most of the ADRC simulation modules are simulated in the simulink environment and can be replaced and reproducible.)

遗传算法工具箱 希望高手指点 GATOOLS(Genetic Algorithm Toolbox hope you pointing)

Some Matlab Codes for Digital Signal Processing

用Matlab实现波形的衰减振荡 嗯 就是这个功能了(using Matlab oscillation wave attenuation ah is the function of)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)