3105130

说明：  对图像进行灰度处理，乘除处理法处理，加法处理，减法处理(Gray scale, multiplication and division of image)

说明：  MATLAB PIV处理程序，可以方便处理PIV得到图像的流场信息(Matlab PIV processing program can easily process PIV to get the flow field information of the image)

The focus of this project is to experiment with intensity transformations to enhance an image.

C++，人脸变形，选择图片，在图片中选择一个四边形窗口（人物脸部），然后再在内部选择一个四边形窗口，逆时针选择，然后点击变形直接呈现变形结果，点击动画可以查看人脸变形过程(C++ program, select a picture, choose a quadrilateral window (human faces) in the picture, and then select a quadrilateral inside the window, counter-clockwise to select, then click on the deformation presented directly deformation results, click animated facial deformation process can be viewed)

de-speckling of noise in medical ultra sound images...

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)

说明：  基于MATLAB平台下，可获取图片任意点的像素坐标。(Based on MATLAB platform, the pixel coordinates of any point in the picture can be obtained.)

针对多聚焦图像融合，采用基于小波分解和点扩展函数模型PSF相结合的融合方法。(For multi-focus image fusion, based on wavelet decomposition and the point spread function PSF model combining fusion.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)

三个很好的程序，有染色体的识别，车牌跟踪，还有神经网络设计，肯定是非常好的，希望大家从中学习(Three very good procedures, there are chromosome recognition, license plate tracking, as well as neural network design, is certainly very good, I hope you learn from)