DMC2C80-V1.1

说明：  用于三维空间坐标系变换的7参数模型，在设计坐标系变换的各行业应用中用的最多，从数学角度来说也是最严密的转换方法。 由于结果中最多可求得七个转换参数，即三个平移参数、三个旋转参数(Ex、Ey、Ez)和一个尺度缩放因子(m)，因此，通常也被称为七参数法。 (Three-dimensional coordinate system transformation for the 7 parameter model, coordinate system transformation in the design of applications using the most, the industry, from the mathematical point of view, the conversion is the most rigorous methods. Since the results can be obtained up to seven transformation parameters, ie three translation parameters, three rotation parameters (Ex, Ey, Ez) and a zoom scale factor (m), therefore, often referred to as seven-parameter method.)

对遥感影像或者图形图像，是在摄影测量数据处理中比较知名的Moravec算子。希望可以帮助到大家！(Remote sensing image or graphic images, photogrammetric data processing in the more well-known Moravec operator. I hope you can help to everyone!)

图像二值化算法，试用效果还不错，欢迎大家试用(Improved Image and Text Binarization Algorithm)

改进的聚类光流法，聚类方法有kmeans和DBSCAN，光流法金字塔LK可以用，HS光流法占用内存太多。(Improved clustering optical flow method, clustering method kmeans and DBSCAN, pyramid LK optical flow method can be used, HS optical flow occupy too much memory.)

给定的n个点在二维平面上,发现的最大数量点躺在同一直线。(Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. )

opencv是图像处理中常用到的工具箱，本资料为基于此工具箱的图像处理匹配算法SURF的实现代码。(opencv is commonly used in image processing to the toolbox, the toolbox based on this information for the image processing algorithm to match the achievement of SURF code.)

小球沿斜线运动,可以扩展到其他程序中，第一次上传，谢谢。(a ball along with a line.)

OPENCV图像处理模板，有界面编程的，以后运用opencv直接在里面填写代码就可以了(OPENCV image processing template, with interface programming, and after using opencv code directly on the inside can be a complete)

光线跟踪，计算机图形学的实验，实现的是消隐，光线之间的遮挡等(Ray-tracing, computer graphics experiments, realize that the hidden light, such as between the block)

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