elman_pca

shift用于图象匹配的算法，对于搞双目测距的朋友很有用(shift)

双目视觉三维重建程序，输入左右相机匹配点对矩阵，自动计算投影矩阵，并输出射影空间下的三维点坐标(Binocular vision three-dimensional reconstruction program, enter the matching points on the matrix around the camera to automatically calculate the projection matrix, and output under the three-dimensional projective space point coordinates)

matlab实现乘公交看奥运的程序，非常精确(This program is to introduce a mathmatic to solve the problems)

说明：  P码的匹配滤波+FFT的捕获程序。可以用于P码的直接捕获。(P code matched filter+ FFT of the capture program. P code can be used for direct capture.)

Using MoM for analysis Radar cross section RCS

program for your use

Code implementation of a Multilayer Perceptron that learns the logical XOR function (for 2 and 4 inputs).

阵列处理的一个分支，空间谱估计中的MUSIC和ESPRIT算法(Array processing, a branch of the MUSIC spatial spectrum estimation and the ESPRIT algorithm)

读取.bin文件，并以某种格式存入.TXT文件(Read. Bin files, and deposit in some form. TXT file )

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)