Common-standard-pics

利用CSplitterWnd类实现对单文档工程进行视图区域的分割(Using the CSplitterWnd class implements the single document engineering for segmenting the view area)

VC development motion control routines, vb development 12 axis motion control routines

说明：  基于opencv的小面积区域的去除.可以去除面积小于指定面积的无兴趣区域.(Opencv-based small area of the region to remove. Can remove an area of less than the specified area is not interested in the region.)

图像分割源码，是一种基于图论的方法做的。分割的质量超好，不信的话下载下来看，你就清楚了！(Image segmentation source code, is a method based on graph theory to do. Segmentation quality is super good, do not believe it download the next run, you will be clear!)

对测井曲线进行重构的程序，可以充分利用测井特征曲线所反应的岩性特征信息，完成多信息的融合(Log curve reconstruction procedures)

说明：  经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。(Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.)

基于侧抑制的图像分割，在ＰＣＮＮ分割的基础上实现(failed to translate)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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++开发。特别针对十字路口电子警察系统开发。(road line fetch)

AutoCAD二次开发的图像处理代码,对彩色图像进行区域生长,然后提取边界,实现图像分割.(AutoCAD second development of image processing code, color images of regional growth, and then extract the boundary, realize image segmentation.)