finitedifference

Fixed-point for functions of several variables (Function fixed_point_systems(x0, N) approximates the solution of a system of nonlinear equations F(x) = (f1(x), f2(x), ..., fn(x)) = 0 rewritten in the fixed-point form x = G(x) = (g1(x), g2(x), ..., gn(x)). This is done by the user at the bottom of the file. The sub-function G(x) has to be updated accordingly with the given system. The iteration scheme x(k+1) = G(x(k)) is implemented until condition |x(k)- x(k-1)| < tol is met, starting with an initial approxiamtion vector x0. If, after N iterations, the stopping criterion is not reached, a message concerning the iterated x s is displayed. the output consists of iterates of each variables x1, x2, ..., xn in each column. )

Spatial filtering foe digital image processin

Feature extraction for color images using Auto Color Correlogram

说明：  可以实现人脸识别，matlab程序的源代码，国外资源，基于PCA算法 (Face recognition can be achieved, matlab program)

基于matlab的通信系统仿真（调制到中频，基带成形）(Matlab-based communications system simulation (modulated IF, baseband shaping))

运用传输矩阵法，可以计算各个结构光栅透射谱反射谱(The transmission matrix method can be used to calculate the transmission spectrum reflection spectrum of each structure grating.)

说明：  分支定界法（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.)

Matlab在图像处理与目标识别方面的应用实验程序示例。包括三个程序以及详细文档：一、染色体识别与统计，二、汽车牌照定位与字符识别，三、基于BP神经网络识别字符的简单实验(Matlab image processing and target recognition in the application of experimental procedures for example. Consists of three procedures, and detailed documentation: a, chromosome identification and statistics, two license plate location and character recognition, 3, based on BP neural network character of the simple experiment)

support vector classification

matlab 演奏卡农 各种给力 好听啊(matlab demo and most unusual national air. Is to force a good listen)