2019DSP实验

This program contains some basic image processing things, such as: 256 colors to grayscale, contrast stretching, anti-color, brightness change, etc.

基于OPENCV的数字图像处理的Cvvimage库，(CvvImage Class in image process )

画图源程序-图像数据显示，可以对数据进行时间轴的曲线显示，也可以是空间轴的多维显示 (Paint source- the image data, the data can be curve shows the time axis, it can be multi-dimensional display space axis)

索贝尔算子程序，可以对图像进行索贝尔算子处理。(Sobel process program, which can process using sobel method.)

Kalman+CamShift实现视频追踪(Kalman+CamShift video track)

使用QT编程实现2D图像处理的各功能，包括彩色图转灰度、二值化、二值的形态学操作、灰度的形态学操作等等。(Using QT programming each 2D image processing functions, including color conversion grayscale, binary, binary morphological operations, grayscale morphological operations and so on.)

基于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)

对圆形，正方形，长方形等几何图形进行计算面积，周长等运算(Circular, square, rectangular and other geometric shapes are calculated area, perimeter of operation)

基于Visual C++的图像边缘检测工程，以Canny为例(Visual C++-based image edge detection works to Canny Case)

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)