gmm

sar图像的基于R-D模型的几何纠正，主要是利用RD模型的数学公式进行相关的几何纠正(Geometric rectification based on RD model of SAR)

实验一 直线生成算法 实验二 圆弧生成算法 实验三 窗口菜单交互界面 实验四 区域填充算法 实验五 裁剪算法算法 实验六 图形软件开发包/库应用 实验七 曲线的生成算法 实验八 曲面生成算法 实验九 二维图形变换(Experimental line generation algorithm experiment two arcs to generate the algorithm experimental three-window menu interface experiment four regional filling algorithm experimental five-clipping algorithm algorithm experiment six graphics software development package/library application experiment seven curve generation algorithm experiment eight surface generation algorithm experiments ninety-two dimensional graphics transform)

对于二值图像进行labeling,求的对象个数，每个对象的像素数，中心点，长宽高矮值等(labeling for bianry 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)

连续投影算法的Matlab程序 下载后可以直接使用(Successive projections algorithm )

此程序利用openCV中人脸识别于模版匹配实现机器人的运动控制功能，其中机器人控制用了Aria的库和模拟器，使用者可根据控制需要替换这部分程序。 本程序的核心部分一直用于只能轮椅的人脸控制。(This process us face recognition in openCV and template matching to achieve robot motion control functions, which used the Aria library and robot simulator, user need replace this part of the control procedures to achieve their application.)

说明：  最二小乘影像匹配，精度可以达到0.01个像素，也可以最二小乘影像模板匹配。经过修改后可以直接用，只要调用一个函数就搞定，函数参数的说明很清楚，绝对不会有任何困难，非常好用。(Most two Theravada image matching accuracy can reach 0.01 pixel images can also be the most two Theravada template matching. After modifications can be directly used, as long as is you call a function, function parameters, the description is clear and will not have any difficulties, very easy to use.)

用于BMP图像文件的滚动显示，带上下和水平滚动条。(This file is used to display BMP image files, with up-down and horizontal scroll bars.)

这是一个数字图像处理常用的功能的集成软件，用VC++ 编写，可以对图像进行一些常见的操作，也可以自己扩展功能(This is a common feature of digital image processing integrated software, images can perform basic operations)

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