相机图像采集、控制、图像处理、坐标计算、坐标显示等功能的小软件 WProject

华中科技大学图像所张桂林老师的数字图像处理课件(Huazhong University of Science and Technology teacher Zhang Guilin images of digital image processing software)

任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中 工程名：Project_BFS 要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点 (Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFSSearch class project name: Project_BFS Requirements: for generating arbitrary topology, find the number of its branches, and output node of each branch)

mfc图像处理，实现图像的配准，自己编写，可以应用(mfc image processing, image registration)

这个是图像处理中的hough变换的C++源代码，工需要的同学参考学习。(This is the image processing hough transform C++ source code, engineering students need to learn.)

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

说明：  用c写的jpg编解码，包括jpeg2bmp和bmp2jpeg，可在vc6下调试。(With c written jpg codec, including jpeg2bmp and bmp2jpeg, may be under vc6 debugger.)

图像球面化，对于输入的图片进行球面变换达到图形变形的效果(Spherical image of, for input images to spherical transformation to achieve the effect of graph distortion)

本文以自主驾驶车辆为实际应用背景．提出了一种改进的ＲＲＴ（快速随机搜索树）路径规划算法．该路 径规划算法将非完整性约束条件与双向多步扩展ＲＲＴ搜索算法相结合，在提高搜索效率的同时保证了规划路径的可 行性．同时将路径点作为Ｂ样条基函数的控制点，用三次Ｂ样条函数来拟合控制点生成平滑可跟踪的路径．通过在平 面障碍物环境下实验，验证了该算法的有效性．(ＡｉｍｉｎｇａｔｔｈｅａｐｐｌｉｃａｔｉｏｎｏｆＡＬＶ（ａｕｔｏｍａｔｉｃｌａｎｄｖｅｈｉｃｌｅ），ａｎｉｍｐｒｏｖｅｄＲＲＴ（ＲａｐｉｄｌｙＲａｎｄｏｍ?ｅｘｐｌｏｒｉｎｇ Ｔｒｅｅｓ）ｐａｔｈｐｌａｎｎｉｎｇａｌｇｏｒｉｔｈｍ ｉｓｐｒｏｐｏｓｅｄ．Ｔｈｅａｌｇｏｒｉｔｈｍ ｃｏｍｂｉｎｅｓｔｈｅｎｏｈｏｌｏｎｏｍｉｃｃｏｎｓｔｒａｉｎｔｓｏｆｖｅｈｉｃｌｅｗｉｔｈｄｏｕｂｌｅｅｘｔｅｎｄ ＲＲＴｓ，ｗｈｉｃｈｎｏｔｏｎｌｙｉｍｐｒｏｖｅｓｔｈｅｅｆｆｉｃｉｅｎｃｙｏｆｓｅａｒｃｈｉｎｇｂｕｔａｌｓｏｇｕａｒａｎｔｅｅｓｔｈｅｆｅａｓｉｂｉｌｉｔｙｏｆｔｈｅｐａｔｈａｔｔｈｅｓａｍｅｔｉｍｅ．Ｔｈｅｐａｔｈ ｐｏｉｎｔｓａｒｅｔａｋｅｎａｓｒｅｆｅｒｅｎｃｅｐｏｉｎｔｓｆｏｒｔｈｅＢ?ｓｐｌｉｎｅｂａｓｉｃｆｕｎｃｔｉｏｎ，ａｐｐｒｏａｃｈａｎｄｃｒｅａｔｅａｎｅｗｓｍｏｏｔｈｒｏｕｔｅｗｈｉｃｈｓｕｉｔｓｆｏｒｔｈｅｖｅｈｉ? ｃｌｅｔｏｆｏｌｌｏｗ．Ｔｈｅｓｉｍｕｌａｔｉｏｎｏｕｔｃｏｍｅｓａｎｄｆｉｅｌｄｔｅｓｔｓｖｅｒｉｆｙｔｈｅｅｆｆｅｃｔｉｖｅｎｅｓｓｏｆｔｈｅｍｅｔｈｏｄｐｒｏｐｏｓｅｄ．)

基于PCL的估算散乱点云的法矢量，并进行颜色渲染显示(estimation of normal vectors for point clouds and color rendering display based on PCL)

线性变换，如图像的拉伸变换等，调试通过，简单易学(Linear transformation, such as image stretching transformation, debugging through easy to learn)