lightcompension

使用光流法对运动目标进行估计，要使用opencv一起实现。效果还不错(Using optical flow method to estimate the moving target, to use opencv implemented together. Results were pretty good)

对图像做spca有监督的主成分分析降维，并投影回图像来降噪，在本程序中，使用正弦函数控制图像变化，函数值作为监督信息(Image do spca supervised principal component analysis dimension reduction, noise reduction and projected back images)

1.模式匹配：子串在主串中的定位，也叫字符串匹配。模式匹配成功是指在主串S中能够找到模式串T，否则，称模式串T在主串S中不存在。 2.模式匹配的应用在非常广泛。例如，在文本编辑程序中，我们经常要查找某一特定单词在文本中出现的位置。 3.模式匹配算法的研究能极大地提高文本编辑程序的响应性能。 (1 pattern matching: substring positioned in the main string, also called string matching. Pattern matching refers success can be found in the main string S pattern string T, otherwise known as pattern string T does not exist in the main string S. 2 pattern matching in a very wide range. For example, in a text-editing program, we often have to find the location of a particular word appears in the text. 3 study of pattern matching algorithms can greatly improve the response performance of text editing program.)

说明：  可支持手写数字识别，r和python两种语言编写，生成画板鼠标手写输入，也支持上传图片(Handwritten digit recognition)

计算电磁波辐射的FDTD程序源码，基于C++编写，支持MUR和PML边界条件，能计算SAR及天线辐射方向图(FDTD source code based on C++.Various absorbing boundary, include PEC, Mur, PML Calculate Specific Absorption Rate (SAR) Antenna radiation simulation, calculate radiation power.)

图像SURF特征提取，用于图像拼接和篡改检测，注释比较详细，程序很好理解(SURF feature extraction, image is used for image matching and tamper detection, comments are detailed, the program is easy to understand)

sobel segmentation, this algorithme has a great effect for segmenting

典型的图像分割算法，希望对大家有用，多多支持，(Typical image segmentation algorithm, useful for all of us hope, a lot of support,)

说明：  图像融合算法，高通滤波法、IHS法、PCA主成分分析、小波融合、小波和IHS结合的融合方法(Image fusion algorithm, high pass filter method, IHS method, PCA principal component analysis, wavelet fusion, wavelet and IHS fusion method)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)