IPKejian

radon算法opencv实现，能够很好的实现图像的水平旋转矫正。( implementing the radon by opencv.)

通过点云数据的格网化，建立格网分块索引，这是一种有效的点云数据存储方式。( Through the point cloud data grid , the establishment of a grid block index, which is a valid point cloud data storage. )

通过对二维人脸图片的特征提取进行三维人脸的重建(Through the two-dimensional face image feature extraction for three-dimensional reconstruction of human faces)

说明：  位图分析转换软件 可以分析8，16，24，32位BMP图 输出可选16位，18位，24位RGB格式 同时支持串行下载(Bitmap analysis of 8,16,24,32-bit conversion software can map out the optional 16-bit BMP, 18 bit, 24-bit RGB format also supports serial download)

C语言数学形态学的腐蚀运算，同时适用于二值图像与灰度图像。(C language mathematical morphology erosion operation also apply to binary images and gray-scale image.)

基于opencv的MHT的多目标跟踪程序(Based on the MHT multi-target tracking program)

采集RGB-D深度图像生成点云矩阵，属于RGB-D SLAM的前端处理过程(Collecting depth image to generate point cloud)

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

说明：   最简单的差分格式有向前、向后和中心3种。 向前差分：f (n)=f(n+1)-f(n) 向后差分：f (n)=f(n)-f(n-1) 中心差分：f (n)=[f(n+1)-f(n-1)]/2(The easiest difference format forward, backward, and three kinds of centers. Forward differencing: f (n) = f (n+ 1)-f (n) Backward difference: f (n) = f (n)-f (n-1) Central difference: f (n) = [f (n+ 1)-f (n-1)]/2)

老外写的程序，可对三角形进行渲染，有详细的算法介绍。非常棒(A good Triangle Renderer Project，with detailed introduction.)