DebugDemo

gdal读tiff图像,获取图像大小，波段信息，图像数据，写Tiff图像到固定路径。(Read and write an TIff image using GDAL)

SLIC超像素分割matlab版本，主要算法为C++与matlab算法联动(SLIC super pixel segmentation matlab version, the main algorithm is C++ and matlab algorithm linkage)

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

说明：  处理geotiff图像文件格式的开源库，含VC工程文件，编译时需tiff库（libtiff）的支持(handling GeoTIFF image file format open source, containing VC engineering documents, compiled take tiff library (libtiff) support)

K均值聚类算法对图像进行分割，实验用程序，亲测可用。(K-means clustering algorithm for image segmentation, experimental procedures, pro-test is available.)

1.本程序功能包含显示直方图，OTSU的单值分割，OTSU的二值分割,OTSU的三值分割 2.在OTSU的分割时，通常情况下我们是通过类间方差得到一个分割阈值，但是有时候我们需要得到各灰度级别的目标，那么采取多值分割是 很必要的，通过改进得到OTSU的多值分割方法 3.本程序另外还有显示直方图，计算程序运行时间，处理结果以新的窗口显示等细节，这部分适合MFC初学者。(1. This procedure shows the histogram feature, OTSU single segmentation, OTSU binary segmentation, OTSU three segmentation 2. OTSU segmentation, it is usually the case we are through the between-cluster variance by a partition threshold , but sometimes we need to be the gray level of the target, then the multi-segmentation is necessary, through improved access to multi-OTSU segmentation methods 3. This procedure in addition to show the histogram to calculate run time, treatment the results of a new window display the details of this part of MFC for beginners.)

正反馈主动频率偏移法，是应用于孤岛检测的一种算法，可以减小检测盲区，加快孤岛检测速度(Positive feedback active frequency offset method is an algorithm used in islanding detection)

说明：  本程序使用MFC编写了一个能够在同一界面上显示立体图形的三视图的源程序。(This program using MFC wrote a can in the same interface shown on the SanShiTu three-dimensional graph of the source program.)

VC++,DirectX,运动图像检测,运动轨迹跟踪(VC++, DirectX movement trajectory tracking image 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.)