DIP_vc

VC计算机图形学原理及算法教程 VC计算机图形学入门教程(VC theory and algorithms of computer graphics computer graphics tutorial Tutorial VC)

SEISPLOT 可以弥补FIMAGE软件带来的不足，即可以实时地显示更多剖面。而且还可以进行其它格式的转换。(seisplot is a software for seismic profile viewing.)

基于规格化Hough变换的天波超视距雷达检测前跟踪算法(Hough transform based on the normalized horizon radar detection and tracking algorithms)

这是三维点云数据边缘线提取的c++算法，适合于LIDAR数据的三维处理，供大家参考学习(This is 3 d point cloud data edge extraction of c++ algorithm, suitable for LIDAR data 3 d processing, provide everyone reference to study)

自主选择性的查看一幅图像中的部分区域的颜色直方图：允许用户在一幅图像中选择一个矩形区域，通过按住鼠标键画一个矩形，当鼠标放开是，高亮显示矩形框，同时在另一个独立的窗口中，使用画图函数画一个图表（选定区域的颜色直方图），分别用蓝，绿，红表示选中区域中每种颜色的像素数量。(Self-selective color in an image to view a partial area of ​ ​ the histogram: Allows the user to select a rectangular area in an image by holding down the mouse button to draw a rectangle when the mouse is released, the highlighted rectangle, Meanwhile in a separate window, using the drawing functions to draw a chart (selected color histogram region), respectively, with blue, green, red indicates the number of pixels in the selected area of ​ ​ each color.)

VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考(VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

实现对图像平滑模糊，有简单平滑、高斯模糊和中值滤波三种可选，基于OPenCV类库实现，代码可直接运行(Achieve a smooth blur the image, a simple smooth, Gaussian blur and median filtering three options, OPenCV-based library, the code can be run directly)

ostu二值化算法vc实现，基于MIL图像处理软件包将图像解析，通过ostu求取二值化阈值，实现二值化算法(ostu binarization algorithm to achieve vc, MIL image processing software package based on the image resolution, strike through ostu binarization threshold binarization algorithm to achieve)

高斯混合模型的源代码。从文件中读取数据，用三个高斯混合模型进行处理(Gaussian mixture model of the source code. Read from the file data, using three Gaussian mixture model for processing)