polygon

讲解滤波与二值图像处理，比较简单的图像处理源码(Explain the filtering and binary image processing, image processing source code is relatively simple)

：植物种类识别方法主要是根据叶片低维特征进行自动化鉴定。然而，低维特征不能全面描述叶片信息，识别准确率低，本文提 出一种基于多特征降维的植物叶片识别方法。首先通过数字图像处理技术对植物叶片彩色样本图像进行预处理，获得去除颜色、虫洞、 叶柄和背景的叶片二值图像、灰度图像和纹理图像。然后对二值图像提取几何特征和结构特征，对灰度图像提取 Hu不变矩特征、灰 度共生矩阵特征、局部二值模式特征和 Gabor 特征，对纹理图像提取分形维数，共得到 2183 维特征参数。再采用主成分分析与线性 评判分析相结合的方法对叶片多特征进行特征降维，将叶片高维特征数据降到低维空间。使用降维后的训练样本特征数据对支持向量 机分类器进行训练(plant species identification method is mainly based on blade automatic identification of low dimensional characteristics.However, can not fully describe blade low-dimensional feature information, identification accuracy is low, in this paper A kind of plant leaves recognition method based on multiple feature dimension reduction.First by digital image processing technology to the plant leaf color sample image preprocessing, obtain background color removal, wormhole, petioles, and the blades of a binary image, gray image and texture image.Then the binary image to extract the geometric characteristics and characteristics of structure and characteristics of gray image extraction Hu moment invariants, gray co-occurrence matrix feature, local binary pattern features and Gabor, to extract the fractal dimension of texture image, get 2183 d characteristic parameters.By principal component analysis and linear uation analysis method of combining the characteristics of blade more feature dimensi)

图像处理的KMP算法源程序，KMP算法是一种基本的、实用的字符串比较算法，广泛应用于图像处理和模式识别。(Image processing algorithms source KMP, KMP algorithm is a basic, practical string comparison algorithm, widely used in image processing and pattern recognition.)

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)

利用DOA和TOA对运动辐射源的单舰无源定位(Using a single passive location DOA and TOA ship moving emitter)

说明：  基于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.)

2维的基于互信息的图像配准算法，使用powell法作为优化算法(2-dimensional mutual information based image registration algorithms, the use of law as the optimization algorithm powell)

vb6 project photo see edit

说明：  计算机图形学基本算法 DDA直线 中点直线 BRESEMHAM圆 正负法圆 B样条曲线 B曲线 (DDA line algorithm for computer graphics, the midpoint of the basic straight-line method BRESEMHAM circle round the positive and negative B-spline curve B curve)

sobel segmentation, this algorithme has a great effect for segmenting