generatePointCloud.cpp.tar

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)

应用Intel® JPEG Library v1.5处理图像的例子(Using Intel® JPEG Library v1.5 to process image.)

说明：  打包的二维三维图形图像处理源代码 稀有资源(packed 2D and 3D graphics processing source of scarce resources)

视频演示算法包括： 1. 静态背景下的背景预测法目标检测 2. 静态背景下帧间差分法目标检测 3. Mean Shift目标跟踪方法 4. 重心多目标跟踪方法 (Algorithm for video presentation include: 1. Static background background prediction target detection 2. Static background frame difference method for target detection 3. Mean Shift tracking method 4. Gravity multi-target tracking method)

说明：  用C语言实现图像的平滑，锐化及双线性内插算法的实现，效果很好(Using C language to achieve image smoothing, sharpening and bilinear interpolation algorithm to achieve good results)

用于火焰尖角、圆形度、纹理的测量以及图像颜色、矩阵、边缘直方图的测量(For flame sharp corners, roundness, texture measurements, and image color, matrix, edge histogram measurements)

实现鱼眼图 圆形视场和全视场的校正、分为2幅图像、4幅图像、任意角度、任意位置的校正、全景图拼接等(Fish eye diagram of a circular field of view and full field calibration is divided into two images, four images at any angle, any position of the correction, and panoramic stitching.)

本文针对多光谱图像配准中不同光谱图像间存在较大的灰度差异、同一景物在不同波段表现的特征也各不相同等问题，提出了基于互信息相似性测度的多光谱图像配准算法。(In this paper, multi-spectral image registration between different spectral image there is a big difference in gray scale, the same scene in different bands performance characteristics are different questions, we present a similarity measure based on mutual information of multi-spectral image registration algorithm .)

图像处理系列之边缘检测篇 涵盖内容： 1>Roberts算子 2>Prewitt算子 3>Sobel算子 4>Laplacian算子(Edge Detection)

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