D2R9

经典的数字图像处理的形态学处理，包含源代码(Digital image processing morphological processing)

Visual C++数字图像处理技术与工程案例，各章节源代码，这是第一章的代码(The Visual C++ digital image processing technology and engineering cases, the source code of each chapter, this is the first chapter of the code)

Camshift算法，即"Continuously Adaptive Mean-Shift"算法，是一种自适应的运动跟踪算法。它主要通过视频图像中运动物体的颜色信息来达到跟踪目的。(Camshift algorithm, namely " Continuously Adaptive Mean-Shift" algorithm is an adaptive motion tracking algorithm. It is primarily the color information of the object' s movement through the video images to achieve tracking purposes.)

激光三维点云的处理源码，可以压缩点云，配准点云(Three-dimensional laser point cloud processing source code, can be compressed point cloud, point cloud registration)

用mfc编程实现数字图像处理的一些简单操作，只能处理bmp格式图片。调节对比度、亮度、边缘检测等。(Mfc programming with some simple digital image processing operations, can only deal with bmp format images. Adjust contrast, brightness, edge detection.)

主要用于打开8位、24位BMP图像，并对其进行相应的处理，如：颜色分量提取，检测等(key to open the eight, 24 BMP images, and its corresponding treatment, such as : color component extraction, testing)

基于OpenCV实现的图像剪切，截取小软件，对学习OpenCV的朋友比较有帮助(OpenCV based on the realization of the image shear, the interception of a small software, to learning more OpenCV friends help)

说明：  对给定图片求图片中的染色体个数。具体步骤：中值滤波方法，二值化处理，膨胀和腐蚀，开闭运算，求连通区的个数(Of a given picture for the picture of the chromosome number. Concrete steps: median filter method, binarization processing, expansion and corrosion, opening and closing operations, and the number of connected areas)

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

在图像传输时，常常需要对图像进行压缩，这些代码用来对图像进行压缩编码。(In the image transmission, it is often the need for image compression, the code used to image compression.)