imagejiansuo

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

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

小型图像处理平台，包括滤波，边缘提取，边缘优化以及图像匹配功能(Small image processing platform, including filtering, edge detection, edge optimization and image matching function)

锐化图片 拉普拉斯算法 两种方法 一种是自己写的一种是用了matlab里面自带的函数(ruihua picture Laplace there are two mechof a fi [as fs aflasl;nvb)

halcon代码 ，对图像添加高斯噪声 椒盐噪声(halcon code, add the image Gaussian noise impulse noise)

基于AdaBoost的人脸检测程序代码(是用c++编写的)(AdaBoost-based face detection program code (written with c++))

基于SUFT的特征提取与匹配，内涵详细的文档说明，很好的实现了特征提取与匹配，该方法较基本的SIFT有很大的提高(Extraction and matching of features based on SUFT, detailed content of the documentation, very good realization of the feature extraction and matching, SIFT the method is basic is greatly improved)

halcon图像处理软件用来检检测图像的圆状物体。可直接使用。 (halcon image processing software is used to check the oblong object detection image. Can be used directly.)

CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 　　 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。(The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del)

一个扫雷应用程序，在VC下开发，用来提高编程水平(A de-mining applications, developed in the VC used to improve the programming level)